Distance-regularised graphs are distance-regular or distance-biregular

DOI10.1016/0095-8956(87)90027-XMaRDI QIDQ1821114zbMATH OpenOpenAlexFDO

Authors John Shawe-Taylor, Chris Godsil

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0095-8956(87)90027-x

zbMATH Keywords

distance-regular graphsdistance-biregulardistance-regularised graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• scientific article; zbMATH DE number 43547
• Two distance-regular graphs
• Distance biregular bipartite graphs
• Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
• Pseudo-distance-regularized graphs are distance-regular or distance-biregular

Cites work

• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• Automorphism groups of primitive distance-bitransitive graphs are almost simple
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• Generalized n-gons and Chebyshev polynomials
• Spectral conditions for the reconstructibility of a graph

Cited in

(39)

• Edge-distance-regular graphs
• Completely regular clique graphs. II
• A simple approach for lower-bounding the distortion in any hyperbolic embedding
• The \(M\)-matrix group inverse problem for distance-biregular graphs
• Edge-distance-regular graphs are distance-regular
• Completely regular clique graphs
• Spectrally extremal vertices, strong cospectrality, and state transfer
• Pseudo-distance-regularized graphs are distance-regular or distance-biregular
• Distance mean-regular graphs
• The subconstituent algebra of an association scheme. I
• On (almost) 2-Y-homogeneous distance-biregular graphs
• State transfer on graphs
• Polynomial characterizations of distance-biregular graphs
• Distance biregular bipartite graphs
• Algebraic characterizations of graph regularity conditions
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Continuous time quantum walks on graphs: group state transfer
• The dual of Pasch's axiom
• A Q-polynomial structure associated with the projective geometry L_N (q)
• Classification of Ryser graphs
• P-polynomial and bipartite coherent configurations
• Intersection diagrams of distance-biregular graphs
• On the 2-\(Y\)-homogeneous condition of the incidence graphs of 2-designs
• On strongly closed subgraphs of highly regular graphs
• Locally s-distance transitive graphs
• A Spectral Moore Bound for Bipartite Semiregular Graphs
• Semiregular graphs and their algebra
• Automorphism groups of primitive distance-bitransitive graphs are almost simple
• A general method to obtain the spectrum and local spectra of a graph from its regular partitions
• On the Terwilliger algebra of distance-biregular graphs
• Coverings of complete bipartite graphs and associated structures
• Quotients of association schemes
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• On the distance spectrum of minimal cages and associated distance biregular graphs
• Characterizing imprimitive partition designs of binary Hamming graphs
• Distance regular covers of the complete graph
• The spectral excess theorem for distance-biregular graphs.
• Edge-distance-regular graphs

This page was built for publication: Distance-regularised graphs are distance-regular or distance-biregular

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