Inverse problem for Albertson irregularity index

Abstract

Graph indices have attracted great interest as they give us numerical clues for several properties of molecules. Some indices give valuable information on the molecules under consideration using mathematical calculations only. For these reasons, the calculation and properties of graph indices have been in the center of research. Naturally, the values taken by a graph index is an important problem called the inverse problem. It requires knowledge about the existence of a graph having index equal to a given number. The inverse problem is studied here for Albertson irregularity index as a part of investigation on irregularity indices. A class of graphs is constructed to Show that the Albertson index takes all positive even integers. It has been proven that there exists at least one tree with Albertson index equal to every even positive integer but 4. The existence of a unicyclic graph with irregularity index equal to m is shown for every even positive integer m except 4. It is also shown that the Albertson index of a cyclic graph can attain any even positive integer.