Diameters of random circulant graphs (Q2439833)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6270638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Diameters of random circulant graphs |
scientific article; zbMATH DE number 6270638 |
Statements
Diameters of random circulant graphs (English)
0 references
17 March 2014
0 references
The authors consider circulant graphs and calculate diameters of these graphs. The diameter of a graph is an important aspect of a graph which is defined as the maximum distance between all vertices of the graph. They make their calculations by means of the length of the shortest cycle in a directed quotient lattice graph.
0 references
circulant graph
0 references
diameter of a graph
0 references
connectedness of a network
0 references
0 references
0.8189069628715515
0 references
0.7938252687454224
0 references
0.7899577617645264
0 references
0.7864567637443542
0 references
