A family of graphs and the degree/diameter problem (Q2744572)
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: A family of graphs and the degree/diameter problem |
scientific article; zbMATH DE number 1652668
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A family of graphs and the degree/diameter problem |
scientific article; zbMATH DE number 1652668 |
Statements
A family of graphs and the degree/diameter problem (English)
0 references
24 August 2002
0 references
regular graph
0 references
degree
0 references
diameter
0 references
0.90767044
0 references
0.9025042
0 references
0.9008522
0 references
0.89911807
0 references
0.8990943
0 references
0 references
0.8971134
0 references
0.8966762
0 references
Given a suitable permutation \(\sigma\) of \(V(K_n)\), a family of graphs is described with the help of the union of orbits of \(\sigma\) in its action on \(E(K_n)\). Some of the graphs in this family turn out to be the largest known graphs for certain degree/diameter values.
0 references
