Diameters of random circulant graphs (Q2439833): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q394648 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Ismail Naci Cangul / rank | |||
Normal rank | |||
Revision as of 04:24, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Diameters of random circulant graphs |
scientific article |
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
