A generalization of the odd-girth theorem

DOI10.1016/j.disc.2015.10.031zbMath1327.05095OpenAlexW2179013458MaRDI QIDQ898170

N. E. Zubov

Publication date: 8 December 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.10.031

zbMATH Keywords

distance-regular graphgraph eigenvaluegeneralized odd graphspectral excess theoremodd girth

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• A spectral excess theorem for nonregular graphs
• A short proof of the odd-girth theorem
• An odd characterization of the generalized odd graphs
• A simple proof of the spectral excess theorem for distance-regular graphs
• On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
• On distance-regularity in graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• The Laplacian spectral excess theorem for distance-regular graphs
• Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes

This page was built for publication: A generalization of the odd-girth theorem