Homogeneous graphs and regular near polygons (Q1322008)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Homogeneous graphs and regular near polygons |
scientific article |
Statements
Homogeneous graphs and regular near polygons (English)
0 references
17 August 1994
0 references
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.
0 references
homogeneous graph
0 references
distances
0 references
distance-regular graphs
0 references
clique
0 references