The normalized Laplacian spectrum of subdivisions of a graph

DOI10.1016/j.amc.2016.04.033zbMath1410.05144arXiv1510.02394OpenAlexW2193378305WikidataQ57772679 ScholiaQ57772679MaRDI QIDQ1733531

Francesc Comellas, Pinchen Xie, Zhong-Zhi Zhang

Publication date: 21 March 2019

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

Full work available at URL: https://arxiv.org/abs/1510.02394

zbMATH Keywords

subdivision graphdegree-Kirchhoff indexspanning treesKemeny's constantnormalized Laplacian spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Network coherence and eigentime identity on a family of weighted fractal networks, The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks, Resistance distance and Kirchhoff index in generalized R-vertex and R-edge corona for graphs, An iteration method for computing the total number of spanning trees and its applications in graph theory, The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications, The Normalized Laplacian Spectrum of Folded Hypercube with Applications, On the normalized Laplacians with some classical parameters involving graph transformations, Bounds on Kemeny's constant of trees with a prescribed matching number, Normalized Laplacian spectrum of some subdivision-joins and \(R\)-joins of two regular graphs, The normalized Laplacian spectrum of quadrilateral graphs and its applications, The spectra and the signless Laplacian spectra of graphs with pockets, Kemeny's constant and the Kirchhoff index for the cluster of highly symmetric graphs, On the second largest normalized Laplacian eigenvalue of graphs, The behavior of Tutte polynomials of graphs under five graph operations and its applications, Normalized algebraic connectivity of graphs, Controlling the trapping efficiency in a family of scale-free tree networks, Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs, Combinatorial properties of Farey graphs, Spectra of \((H_1, H_2)\)-merged subdivision graph of a graph, EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET, Group inverse matrix of the normalized Laplacian on subdivision networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• Graph spectra in computer science
• Spectra of graphs
• Geometric bounds for eigenvalues of Markov chains
• Resistance distance and the normalized Laplacian spectrum
• Spectral analysis on infinite Sierpiński gaskets
• The smallest eigenvalue for reversible Markov chains
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Graph spectral techniques in computer sciences
• Algebraic aspects of the normalized Laplacian
• Kemeny's Constant and the Random Surfer
• An Interlacing Result on Normalized Laplacians
• Sparse random graphs: Eigenvalues and eigenvectors
• The Role of Kemeny's Constant in Properties of Markov Chains
• Vibration modes of 3n-gaskets and other fractals