Distance-regularised graphs are distance-regular or distance-biregular
The authors are concerned that the theory of distance-regular graphs does not apply directly to the graphs of generalised polygons. They therefore define a distance-regularised graph to be one in which, for any integer k and any vertices x and y, the number of vertices at distance k from x and adjacent to y only depends on the vertex x and the distance between x and y. It is then shown that te nonbipartite distance regularised graphs are distance regular, while the bipartite ones are distance-biregular. Much of the theory of distance-regular graphs is extended to distinct- regularised graphs. Apart from the generalised polygons, three classes of distance-biregular graphs are given. The question of whether these are all the distance biregular graphs remains open.
- 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
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- Spectral conditions for the reconstructibility of a graph
- Distance-biregular graphs with 2-valent vertices and distance regular line graphs
- Automorphism groups of primitive distance-bitransitive graphs are almost simple
- The dual of Pasch's axiom
- Distance regular covers of the complete graph
- Distance biregular bipartite graphs
- Coverings of complete bipartite graphs and associated structures
- Quotients of association schemes
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- A simple approach for lower-bounding the distortion in any hyperbolic embedding
- Algebraic characterizations of graph regularity conditions
- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
- Characterizing imprimitive partition designs of binary Hamming graphs
- On strongly closed subgraphs of highly regular graphs
- On the distance spectrum of minimal cages and associated distance biregular graphs
- On (almost) 2-Y-homogeneous distance-biregular graphs
- On the 2-\(Y\)-homogeneous condition of the incidence graphs of 2-designs
- On the Terwilliger algebra of distance-biregular graphs
- Distance mean-regular graphs
- Completely regular clique graphs. II
- Spectrally extremal vertices, strong cospectrality, and state transfer
- Intersection diagrams of distance-biregular graphs
- Edge-distance-regular graphs
- Locally s-distance transitive graphs
- A general method to obtain the spectrum and local spectra of a graph from its regular partitions
- Semiregular graphs and their algebra
- Edge-distance-regular graphs are distance-regular
- The spectral excess theorem for distance-biregular graphs.
- Completely regular clique graphs
- Pseudo-distance-regularized graphs are distance-regular or distance-biregular
- Edge-distance-regular graphs
- A Spectral Moore Bound for Bipartite Semiregular Graphs
- The \(M\)-matrix group inverse problem for distance-biregular graphs
- A Q-polynomial structure associated with the projective geometry L_N (q)
- Continuous time quantum walks on graphs: group state transfer
- State transfer on graphs
- The subconstituent algebra of an association scheme. I
- Polynomial characterizations of distance-biregular graphs
- P-polynomial and bipartite coherent configurations
- On 2-Y-homogeneous (Y,Y^)-distance-biregular graphs with D=4
- Classification of Ryser 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)
