Spectral characterization of some weighted rooted graphs with cliques

DOI10.1016/j.laa.2010.05.015zbMath1194.05095OpenAlexW1968014583MaRDI QIDQ5962291

No author found.

Publication date: 21 September 2010

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

Full work available at URL: http://hdl.handle.net/10533/144815

zbMATH Keywords

adjacency matrixweighted graphLaplacian matrixcliquesignless Laplacian matrixgeneralized Bethe tree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Signed and weighted graphs (05C22)

Related Items

Eigenvalues of certain weighted graphs joined at their roots having cliques at some levels ⋮ Bethe graphs attached to the vertices of a connected graph - a spectral approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spectra of some weighted rooted trees and applications
• Signless Laplacians of finite graphs
• On the spectra of some graphs like weighted rooted trees
• 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.
• Laplacian matrices of graphs: A survey
• 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

This page was built for publication: Spectral characterization of some weighted rooted graphs with cliques