On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs

S. R. Jog and Raju Kotambari

Journal of Mathematics, 2016, vol. 2016, 1-11

Abstract:

Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under spectral graph theory. In this paper, we compute adjacency, Laplacian, and signless Laplacian energy ( energy) of coalescence of pair of complete graphs. Also, as an application, we obtain the adjacency energy of subdivision graph and line graph of coalescence from its energy.

Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JMATH/2016/5906801.pdf (application/pdf)
http://downloads.hindawi.com/journals/JMATH/2016/5906801.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:5906801

DOI: 10.1155/2016/5906801

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().