COLOR LAPLACIAN ENERGY OF SOME CLUSTER GRAPHS

COLOR LAPLACIAN ENERGY OF SOME CLUSTER GRAPHS

S. D'Souza, Gowtham H. J., Pradeep G. Bhat, Girija K. P.

[PDF]

Abstract

The color energy of a graph G is dened as the sum of the absolute values of the color eigenvalues of G. The graphs with large number of edges are referred as cluster graphs. Cluster graphs are obtained from complete graphs by deleting few edges according to some criteria. Bipartite cluster graphs are obtained by deleting few edges from complete bipartite graphs according to some rule. In this paper, we study the color Laplacian energy of cluster graphs and bipartite cluster graphs obtained by deleting the edges of complete and complete bipartite graph respectively.

Keywords

color Laplacian matrix, color Laplacian eigenvalues, color Laplacian energy