The Eigen-chromatic Ratio of Classes of Graphs: Asymptotes, Areas and Molecular Stability

Abstract

two graph theoretical concepts of energy and chromatic number. The energy of a graph, the sum of the absolute values of the eigenvalues of the adjacency matrix of a graph, arose historically as a result of the energy of the benzene ring being identical to that of the sum of the absolute values of the eigenvalues of the adjacency matrix of the cycle graph on n vertices (see [18]). The chromatic number of a graph is the smallest number of colour classes that we can partition the vertices of a graph such that each edge of the graph has ends that do not belong to the same colour class, and applications to the real world abound (see [30]). Applying this idea to molecular graph theory, for example, the water molecule would have its two hydrogen atoms coloured with the same colour different to that of the oxygen molecule. Ratios involving graph theoretical concepts form a large subset of graph theoretical research(see [3], [16], [48]). The eigenchromatic ratio of a class of graph provides a form of energy distribution among the colour classes determined by the chromatic number of such a class of graphs. The asymptote associated with this eigen-chromatic ratio allows for the behavioral analysis in terms of stability of molecules in molecular graph theory where a large number of atoms are involved. This asymptote can be associated with the concept of graphs being hyper-or hypo- energetic (see [48])