Fractional decompositions and the smallest-eigenvalue separation

zbMath1428.05196arXiv1907.08447MaRDI QIDQ2278118

Bojan Mohar, Fiachra Knox

Publication date: 9 December 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

fractional decompositions of graphssmallest eigenvalue of non-bipartite distance-regular graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (3)

A spectral bound for vertex-transitive graphs and their spanning subgraphs ⋮ Some observations on the smallest adjacency eigenvalue of a graph ⋮ Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue

Cites Work

• A valency bound for distance-regular graphs
• Non-bipartite distance-regular graphs with a small smallest eigenvalue
• Tales of Hoffman: three extensions of Hoffman's bound on the graph chromatic number
• Unnamed Item
• Unnamed Item

This page was built for publication: Fractional decompositions and the smallest-eigenvalue separation