Eigenvalues of certain weighted graphs joined at their roots having cliques at some levels

DOI10.1016/j.laa.2012.03.023zbMath1243.05154OpenAlexW2149276176MaRDI QIDQ426081

J. Herrera, H. S. Yoon

Publication date: 11 June 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.03.023

zbMATH Keywords

adjacency matrixweighted graphLaplacian matrixcliquesignless Laplacian matrixgeneralized Bethe treenormalized Laplacian matrix

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spectra of some weighted rooted trees and applications
• Signless Laplacians of finite graphs
• Spectra of weighted generalized Bethe trees joined at the root
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Towards a spectral theory of graphs based on the signless Laplacian, I
• Towards a spectral theory of graphs based on the signless Laplacian, III
• Iterative Methods for Solving Matrix Equations
• Matrix theory. Basic results and techniques
• Spectral characterization of some weighted rooted graphs with cliques