A valency bound for distance-regular graphs

DOI10.1016/J.JCTA.2017.11.008MaRDI QIDQ1689048zbMATH OpenOpenAlexFDO

Authors Zhi Qiao, Jack H. Koolen

Publication date 12 January 2018

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2017.11.008

zbMATH Keywords

smallest eigenvaluedistance-regular graphs3-chromaticvalency bound

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
• On distance-regular graphs with fixed valency. II
• On distance-regular graphs with fixed valency. III
• Bounding the diameter of distance. Regular graphs
• Distance-regular graphs of diameter 3 having eigenvalue \(-1\)

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 5031907 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A Higman-Haemers inequality for thick regular near polygons
• Chromatic number and the 2-rank of a graph
• Distance-regular graphs
• Light tails and the Hermitian dual polar graphs
• On 3-chromatic distance-regular graphs
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• The nonexistence of regular near octagons with parameters \((s,t,t_2,t_3)=(2,24,0,8)\)
• The structure of near polygons with quads
• There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)

Cited in

(15)

• Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
• Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
• Valency of distance-regular antipodal graphs with diameter 4
• On distance-regular graphs with fixed valency. III
• A remark on bipartite distance-regular graphs of even valency
• scientific article; zbMATH DE number 1890144 (Why is no real title available?)
• Fractional decompositions and the smallest-eigenvalue separation
• The maximum valency of regular graphs with given order and odd girth
• Distance-regular Cayley graphs with small valency
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
• On 2-walk-regular graphs with a large intersection number \(c_2\)
• On 3-chromatic distance-regular graphs
• Non-bipartite distance-regular graphs with a small smallest eigenvalue
• There are only finitely many distance-regular graphs of fixed valency greater than two
• A new characterization of the dual polar graphs

This page was built for publication: A valency bound for distance-regular graphs

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