The second exponent set of primitive digraphs (Q1567597)
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: The second exponent set of primitive digraphs |
scientific article; zbMATH DE number 1462265
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The second exponent set of primitive digraphs |
scientific article; zbMATH DE number 1462265 |
Statements
The second exponent set of primitive digraphs (English)
0 references
21 June 2000
0 references
The exponent of a digraph is defined as the shortest length of a directed path that connects any two vertices. The paper deals with bounds on the exponent of primitive graphs.
0 references
exponent
0 references
digraph
0 references
primitive graphs
0 references
0.9165365695953368
0 references
0.8844806551933289
0 references
0.8837715983390808
0 references
0.881942868232727
0 references
0.881942868232727
0 references