Diameter of some monomial digraphs. (English) Zbl 1354.05060
Canteaut, Anne (ed.) et al., Contemporary developments in finite fields and applications. Based on the presentations at the 12th international conference on finite fields and their applications (Fq12), Saratoga Springs, NY, July 13–17, 2015. Hackensack, NJ: World Scientific (ISBN 978-981-4719-25-4/hbk; 978-981-4719-27-8/ebook). 160-177 (2016).
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 A. Kodess and 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.
For the entire collection see [Zbl 1345.11003].
For the entire collection see [Zbl 1345.11003].
Reviewer: Wai-Kai Chen (Fremont)
MSC:
| 05C20 | Directed graphs (digraphs), tournaments |
| 05C12 | Distance in graphs |
| 05C40 | Connectivity |
| 11T06 | Polynomials over finite fields |
