Spectral characterization of some weighted rooted graphs with cliques
From MaRDI portal
Publication:5962291
DOI10.1016/J.LAA.2010.05.015zbMATH Open1194.05095OpenAlexW1968014583MaRDI QIDQ5962291FDOQ5962291
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Signed and weighted graphs (05C22)
Cites Work
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Signless Laplacians of finite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Laplacian matrices of graphs: A survey
- Title not available (Why is that?)
- Towards a spectral theory of graphs based on the signless Laplacian, I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Matrix theory. Basic results and techniques
- Iterative Methods for Solving Matrix Equations
- On the spectra of some weighted rooted trees and applications
- On the spectra of some graphs like weighted rooted trees
Cited In (4)
This page was built for publication: Spectral characterization of some weighted rooted graphs with cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962291)