The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphs

Xiaoling Ma and Hong Bian

Applied Mathematics and Computation, 2019, vol. 355, issue C, 33-46

Abstract: Let HMn be a hexagonal Möbius graph of length n. In this paper, due to the normalized Laplacian polynomial decomposition theorem, we obtain that the normalized Laplacian spectrum of HMn consists of the eigenvalues of two symmetric quasi-tridiagonal matrices LA and LS of order 2n. Finally, by applying the relationship between the roots and coefficients of the characteristic polynomials of the above two matrices, explicit closed formulas of the degree-Kirchhoff index and the number of spanning trees of HMn are given in terms of the index n.

Keywords: Hexagonal Möbius graph; Normalized Laplacian; Degree-Kirchhoff index; Spanning trees (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319301560
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:355:y:2019:i:c:p:33-46

DOI: 10.1016/j.amc.2019.02.052

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().