Non-bipartite distance-regular graphs with a small smallest eigenvalue

zbMATH Open1416.05096arXiv1901.01157MaRDI QIDQ2001973FDOQ2001973

Authors: Zhi Qiao, Yifan Jing, Jack H. Koolen 

Publication date: 11 July 2019

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

Abstract: In 2017, Qiao and Koolen showed that for any fixed integer $Dgeq3$, there are only finitely many such graphs with $het{a}_{min}leq-alphak$, where $0<alpha<1$ is any fixed number. In this paper, we will study non-bipartite distance-regular graphs with relatively small $het{a}_{min}$ compared with $k$. In particular, we will show that if $het{a}_{min}$ is relatively close to $-k$, then the odd girth $g$ must be large. Also we will classify the non-bipartite distance-regular graphs with $het{a}_{min}leqfracD-1D$ for $D=4,5$.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
• Exceptional graphs with smallest eigenvalue -2 and related problems
• Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• Distance-regular graphs
• The distance-regular graphs of valency four
• A valency bound for distance-regular graphs
• Cubic Distance-Regular Graphs
• There are only finitely many distance-regular graphs of fixed valency greater than two
• Some results on the eigenvalues of distance-regular graphs

Cited In (8)

• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
• Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
• Fractional decompositions and the smallest-eigenvalue separation
• A spectral bound for vertex-transitive graphs and their spanning subgraphs
• Title not available (Why is that?)
• Smallest close to regular bipartite graphs without an almost perfect matching
• Distance-regular graphs with small number of distinct distance eigenvalues

This page was built for publication: Non-bipartite distance-regular graphs with a small smallest eigenvalue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2001973)