Distance-regular graphs and halved graphs (Q1084410)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Distance-regular graphs and halved graphs |
scientific article; zbMATH DE number 3979099
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distance-regular graphs and halved graphs |
scientific article; zbMATH DE number 3979099 |
Statements
Distance-regular graphs and halved graphs (English)
0 references
1986
0 references
Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
0 references
bipartite distance-regular graph
0 references
halved graph
0 references
