Spanning trees and even integer eigenvalues of graphs

DOI10.1016/j.disc.2014.01.023zbMath1284.05160arXiv1201.3221OpenAlexW2078007525MaRDI QIDQ2440944

Ebrahim Ghorbani

Publication date: 20 March 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.3221

zbMATH Keywords

line graphLaplaciannullityunicyclic graphsignless Laplacianspanning treeseven integer eigenvalue

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

Graphs with least eigenvalue \(-2\): ten years on

Cites Work

• On a conjecture concerning spanning tree invariants and loop systems
• Signless Laplacians of finite graphs
• A certain polynomial of a graph and graphs with an extremal number of trees
• An interrelation between line graphs, eigenvalues, and matroids
• On the nullity of line graphs of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning trees and even integer eigenvalues of graphs