Computing an irregularity strength of selected graphs

Abstract

In this paper we describe how the problem of computing an irregularity strength of a graph may be expressed and solved in terms of constraint programming over finite domains, i.e. CP(FD). We also present some theoretical and experimental results concerning an irregularity strength computed for cubic graphs and $K_n-e$ graphs. Additionally, we give some remarks on the implementation of our approach in the Oz programming language on the platform of the Mozart system.