Homogeneous graphs and regular near polygons
From MaRDI portal
A homogeneous graph \(\Gamma\) is defined: for every edge \(uv\), and vertex \(x\), the number of edges from \(x\) to \(\Gamma_ i(u)\cap\Gamma_ j(v)\) depends only on \(i\), \(j\) and the distances from \(x\) to \(u\) and \(v\). (\(\Gamma_ i(u)\) is the set of vertices of distance \(i\) from \(u\).) It is proven that, for distance-regular graphs in which the set of common neighbors of adjacent vertices is always a clique, homogeneous graphs are precisely the regular near \(2d\)-gons.
Recommendations
Cited in
(44)- Almost 2-homogeneous graphs and completely regular quadrangles
- An application of intersection diagrams of high rank
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- 2-homogeneous bipartite distance-regular graphs
- Almost 2-homogeneous bipartite distance-regular graphs
- Tight distance-regular graphs
- Restrictions on classical distance-regular graphs
- On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11
- Algebraic characterizations of graph regularity conditions
- 1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs
- Taut distance-regular graphs of even diameter
- Tight distance-regular graphs and the subconstituent algebra
- Taut distance-regular graphs of odd diameter
- \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
- The Sylvester graph and Moore graphs
- Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
- Taut distance-regular graphs and the subconstituent algebra
- An equitable partition for a distance-regular graph of negative type
- A new feasibility condition for the AT4 family
- Edge-distance-regular graphs are distance-regular
- A new characterization of taut distance-regular graphs of odd diameter
- Bipartite distance-regular graphs: the Q-polynomial property and pseudo primitive idempotents
- scientific article; zbMATH DE number 1933058 (Why is no real title available?)
- A new approach to the bipartite fundamental bound
- The local eigenvalues of a bipartite distance-regular graph
- On bipartite distance-regular graphs with exactly two irreducible T-modules with endpoint two
- Intersection graphs of homothetic polygons
- Neighborhood homogeneous labelings of graphs
- Spin models constructed from Hadamard matrices
- Distance-regular graphs related to the quantum enveloping algebra of sl(2)
- Homogeneity of a distance-regular graph which supports a spin model
- Distance-regular graphs with classical parameters that support a uniform structure: case q 1
- Distance-regular graphs with classical parameters that support a uniform structure: case \(q \geq 2\)
- Spin models and distance-regular graphs of \(q\)-Racah type
- 2-homogeneous bipartite distance-regular graphs and the quantum group \(U^\prime_q(\mathfrak{so}_6)\)
- Towards a classification of 1-homogeneous distance-regular graphs with positive intersection number a₁
- An equitable partition for the distance-regular graph of the bilinear forms
- On bipartite Q-polynomial distance-regular graphs
- Almost-bipartite distance-regular graphs with the Q-polynomial property
- On bipartite \(Q\)-polynomial distance-regular graphs with \(c_{2}=1\)
- Distance-regular graphs with complete multipartite -graphs and AT4 family
- On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
- The Terwilliger algebra of a distance-regular graph of negative type
- Distance-regular graphs with light tails
This page was built for publication: Homogeneous graphs and regular near polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322008)
