Line graph of combinations of generalized Bethe trees: Eigenvalues and energy
From MaRDI portal
Publication:550615
DOI10.1016/j.laa.2010.10.008zbMath1222.05178OpenAlexW2025864448MaRDI QIDQ550615
Publication date: 13 July 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.10.008
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
The general Albertson irregularity index of graphs, On the spectrum of finite, rooted homogeneous trees, On the smallest eigenvalues of the line graphs of some trees, Energies of unitary one-matching bi-Cayley graphs over finite commutative rings, Graphs with least eigenvalue \(-2\): ten years on, Quadratic unitary Cayley graphs of finite commutative rings
Cites Work
- Tight bounds on the algebraic connectivity of Bethe trees
- The energy of graphs and matrices
- 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.
- Spectra of copies of a generalized Bethe tree attached to any graph
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
- Laplacian matrices of graphs: A survey
- Parallel concepts in graph theory
- An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
- The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
- Towards a spectral theory of graphs based on the signless Laplacian, I
- A survey of graph laplacians
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Matrix theory. Basic results and techniques
- Energy of line graphs
- Unnamed Item
- Unnamed Item
