Color Laplacian energy of some cluster graphs
View/ Open
Date
2022Author
D’Soza, SabithaGowtham, Halgar Jagadeesh
Bhat, Pradeep Ganapati
Girija, Kulambi Parameshwarappa
Metadata
Show full item recordCitation
D’Soza, S., Gowtham, H. J., Bhat, P. G. & Girija, K. P. (2022). Color Laplacian energy of some cluster graphs. TWMS Journal Of Applied And Engineering Mathematics, 12(1), 247-259.Abstract
The color energy of a graph G is defined 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.
Source
TWMS Journal Of Applied And Engineering MathematicsVolume
12Issue
1URI
https://hdl.handle.net/11729/3404http://jaem.isikun.edu.tr/web/index.php/archive/114-vol12no1/810
Collections
The following license files are associated with this item: