|ISSN 1683-3414 (Print) • ISSN 1814-0807 (Online)|
Address: Vatutina st. 53, Vladikavkaz,
Color Energy of Some Cluster Graphs
D'Souza, S. , Girija, K. P. , Gowtham, H. J. , P. G. Bhat
Vladikavkaz Mathematical Journal 2021. Vol. 23. Issue 2.
Let \(G\) be a simple connected graph. The energy of a graph \(G\) is defined as sum of the absolute eigenvalues of an adjacency matrix of the graph \(G\). It represents a proper generalization of a formula valid for the total \(\pi\)-electron energy of a conjugated hydrocarbon as calculated by the Huckel molecular orbital (HMO) method in quantum chemistry. A coloring of a graph \(G\) is a coloring of its vertices such that no two adjacent vertices share the same color. The minimum number of colors needed for the coloring of a graph \(G\) is called the chromatic number of \(G\) and is denoted by \(\chi(G)\). The color energy of a graph \(G\) is defined as the sum of absolute values of the color eigenvalues of \(G\). The graphs with large number of edges are referred as cluster graphs. Cluster graphs are graphs obtained from complete graphs by deleting few edges according to some criteria. It can be obtained on deleting some edges incident on a vertex, deletion of independent edges/triangles/cliques/path P3 etc. Bipartite cluster graphs are obtained by deleting few edges from complete bipartite graphs according to some rule. In this paper, the color energy of cluster graphs and bipartite cluster graphs are studied.
Keywords: color adjacency matrix, color eigenvalues, color energy
Language: English Download the full text
For citation: D'Souza, S., Girija, K. P., Gowtham, H. J. and Bhat, P. G. Color Energy of Some Cluster Graphs,Vladikavkaz Math. J., 2021, vol. 23, no. 2, pp. 51-64. DOI 10.46698/x5522-9720-4842-z
← Contents of issue
|© 1999-2023 Þæíûé ìàòåìàòè÷åñêèé èíñòèòóò|