Reflexive line graphs of trees
From MaRDI portal
Publication:256547
DOI10.1007/s10801-015-0640-zzbMath1409.05173OpenAlexW2188271776MaRDI QIDQ256547
Dejan Živković, Milica Anđelić, Carlos Martins de Fonseca, Slobodan K. Simic
Publication date: 9 March 2016
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-015-0640-z
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Graphs with all but two eigenvalues in \([-2, 0\)] ⋮ Reflexive line graphs of trees and Salem numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal reflexive cacti with four cycles: The approach via Smith graphs
- Discrete hyperbolic geometry
- The second largest eigenvalue of a tree
- Hyperbolic trees
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- A subdivision theorem for vertices not on internal paths
- A classification of all 1-Salem graphs
- Graphs characterized by the second eigenvalue
- On the second largest eigenvalue of line graphs
- Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
- Salem Numbers, Pisot Numbers, Mahler Measure, and Graphs
This page was built for publication: Reflexive line graphs of trees