Generalized Characteristic Polynomials of Join Graphs and Their Applications

Pengli Lu, Ke Gao and Yang Yang

Discrete Dynamics in Nature and Society, 2017, vol. 2017, 1-10

Abstract:

The Kirchhoff index of is the sum of resistance distances between all pairs of vertices of in electrical networks. is the Laplacian-Energy-Like Invariant of in chemistry. In this paper, we define two classes of join graphs: the subdivision-vertex-vertex join and the subdivision-edge-edge join . We determine the generalized characteristic polynomial of them. We deduce the adjacency (Laplacian and signless Laplacian, resp.) characteristic polynomials of and when is -regular graph and is -regular graph. As applications, the Laplacian spectra enable us to get the formulas of the number of spanning trees, Kirchhoff index, and of and in terms of the Laplacian spectra of and .

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2017/2372931.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2017/2372931.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:jnddns:2372931

DOI: 10.1155/2017/2372931

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().