Line graph eigenvalues and line energy of caterpillars
From MaRDI portal
Publication:551331
DOI10.1016/j.laa.2011.03.064zbMath1222.05177OpenAlexW1998961442MaRDI QIDQ551331
Publication date: 15 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.2011.03.064
adjacency matrixline graphLaplacian matrixcaterpillarsignless Laplacian matrixgeneralized Bethe treeline energy
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Energies of unitary one-matching bi-Cayley graphs over finite commutative rings, Graphs with least eigenvalue \(-2\): ten years on, On conjectures of network distance measures by using graph spectra, Block-indifference graphs: characterization, structural and spectral properties, Quadratic unitary Cayley graphs of finite commutative rings
Cites Work
- Unnamed Item
- The energy of graphs and matrices
- Signless Laplacians of finite graphs
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Spectra of generalized Bethe trees attached to a path
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- 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
- Graph energy change due to edge deletion
- The Laplacian Spectrum of a Graph
- 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
- Eigenvalues and eigenvectors of tridiagonal matrices
- Iterative Methods for Solving Matrix Equations
- Matrix theory. Basic results and techniques
- Energy of line graphs