Diameter of some monomial digraphs (Q2829804)
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: Diameter of some monomial digraphs |
scientific article; zbMATH DE number 6649354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Diameter of some monomial digraphs |
scientific article; zbMATH DE number 6649354 |
Statements
Diameter of some monomial digraphs (English)
0 references
8 November 2016
0 references
monomial digraph
0 references
diameter
0 references
strong connectivity
0 references
0.90717363
0 references
0.89878577
0 references
0 references
0.88818634
0 references
0 references
0 references
The paper first defines a monomial digraph, which is directed analogue of some algebraically defined graphs, which have been extensively studied and used in many applications. The questions of strong connectivity of monomial digraphs and descriptions of their components were answered by \textit{A. Kodess} and \textit{F. Lazebnik} [Electron. J. Comb. 22, No. 3, Research Paper P3.27, 11 p. (2015; Zbl 1360.05077)]. Most of the present results are concerned with the determination of the diameter of a component for strong monomial digraphs. Two theorems are given, listing some of their properties.NEWLINENEWLINEFor the entire collection see [Zbl 1345.11003].
0 references
