Color energy of some cluster graphs.

Dsouza, Sabitha and Girija, K P and Gowtham, H J and Bhat, Pradeep G (2021) Color energy of some cluster graphs. Vladikavkaz Mathematical Journal, 23 (2). pp. 51-64. ISSN 1683-3414

[img] PDF
13024.pdf - Published Version
Restricted to Registered users only

Download (254kB) | Request a copy


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 π-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 χ(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.

Item Type: Article
Uncontrolled Keywords: color adjacency matrix, color eigenvalues, color energy
Subjects: Engineering > MIT Manipal > Mathematics
Depositing User: MIT Library
Date Deposited: 20 Sep 2021 04:56
Last Modified: 20 Sep 2021 04:56

Actions (login required)

View Item View Item