Cubic Distance-Regular Graphs

DOI10.1112/JLMS/S2-33.3.385MaRDI QIDQ3697043zbMATH OpenOpenAlexWikidataFDO

Authors A. G. Boshier, John Shawe-Taylor, Norman L. Biggs

Publication date 1986

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-33.3.385

zbMATH Keywords

classificationcubic distance-regular graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• On distance-regular graphs with fixed valency. II
• Characerization of a class of distance regular graphs.
• A classification of cubic \(s\)-regular graphs of order 16\(p\)
• scientific article; zbMATH DE number 43547
• A classification of the cubic s-regular graphs of orders 12p and 12p^2

Cited in

(39)

• Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
• Distance regular subgraphs of a cube
• A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
• On symmetric association schemes with \(k_1=3\)
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• On geometric distance-regular graphs with diameter three
• Non-geometric distance-regular graphs of diameter at least 3 with smallest eigenvalue at least -3
• The distance-regular graphs of valency four
• Improving diameter bounds for distance-regular graphs
• On regular graphs equienergetic with their complements
• Distance-regular graphs with or at least half the valency
• A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
• Geometric distance-regular graphs without 4-claws
• On bounding the diameter of a distance-regular graph
• Applications of the retracing method for distance-regular graphs
• scientific article; zbMATH DE number 4158673 (Why is no real title available?)
• The regular near polygons of order \((s,2)\)
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• The Sylvester graph and Moore graphs
• Classification of partially metric Q-polynomial association schemes with \(m_1=4\)
• A constant bound on the number of columns (1,k-2,1) in the intersection array of a distance-regular graph
• Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs
• There are only finitely many distance-regular graphs of fixed valency greater than two
• On strongly closed subgraphs of highly regular graphs
• A distance-regular graph with bipartite geodetically closed subgraphs.
• The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
• Non-bipartite distance-regular graphs with a small smallest eigenvalue
• On distance-regular graphs with fixed valency. IV
• A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph
• Distance-regular graphs of valency 6 and a₁=1
• Retracing argument for distance-regular graphs
• Spectral determinations and eccentricity matrix of graphs
• Distance-regular graphs without 4-claws
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• A remark on the intersection arrays of distance-regular graphs
• Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
• A characterization of the Hamming graph by strongly closed subgraphs
• Max-cut and extendability of matchings in distance-regular graphs
• Distance regularity in buildings and structure constants in Hecke algebras

This page was built for publication: Cubic Distance-Regular Graphs

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