Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains

DOI10.1016/j.cam.2018.05.045zbMath1392.05075OpenAlexW2806654778WikidataQ129747413 ScholiaQ129747413MaRDI QIDQ724523

Liqun Sun, Shuchao Li, Wenjun Luo, Chunlin He

Publication date: 26 July 2018

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2018.05.045

zbMATH Keywords

spanning treenormalized Laplacianresistance distancedegree-Kirchhoff indexlinear pentagonal chain

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (13)

Further results on the expected hitting time, the cover cost and the related invariants of graphs ⋮ Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons ⋮ Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star ⋮ Kemeny's constant and global mean first passage time of random walks on octagonal cell network ⋮ The normalized Laplacian spectrum of n -polygon graphs and applications ⋮ On the normalized Laplacians with some classical parameters involving graph transformations ⋮ Some resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of P2 and Kn ⋮ Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters ⋮ Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs ⋮ The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications ⋮ Dumbbell graphs with extremal (reverse) cover cost ⋮ On the Kirchhoff index and the number of spanning trees of cylinder/Möbius pentagonal chain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
• Minimum vertex covers and the spectrum of the normalized Laplacian on trees
• Normalized Laplacian eigenvalues and energy of trees
• A construction of cospectral graphs for the normalized Laplacian
• On the spectrum of the normalized Laplacian of iterated triangulations of graphs
• The distances between internal vertices and leaves of a tree
• Resistance distance and the normalized Laplacian spectrum
• On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs
• Graph cyclicity, excess conductance, and resistance deficit
• Wiener index of hexagonal systems
• The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
• On the Laplacian spectral radius of bipartite graphs with fixed order and size
• Kirchhoff index of periodic linear chains
• The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications
• Extremal values on the eccentric distance sum of trees
• A note about cospectral graphs for the adjacency and normalized Laplacian matrices
• An Interlacing Result on Normalized Laplacians
• ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
• On the extremal values of the eccentric distance sum of trees
• Wiener index of trees: Theory and applications

This page was built for publication: Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains