On diregular digraphs with degree two and excess two
From MaRDI portal
Publication:1701129
DOI10.1016/J.DAM.2017.10.034zbMATH Open1380.05091arXiv1705.00075OpenAlexW2611943276MaRDI QIDQ1701129FDOQ1701129
Authors: James Tuite
Publication date: 22 February 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: An important topic in the design of efficient networks is the construction of -digraphs, i.e. -geodetic digraphs with minimum out-degree and order , where represents the Moore bound for degree and diameter and is the (small) excess of the digraph. Previous work has shown that there are no -digraphs for . In a separate paper, the present author has shown that any -digraph must be diregular for . In the present work, this analysis is completed by proving the nonexistence of diregular -digraphs for and classifying diregular -digraphs up to isomorphism.
Full work available at URL: https://arxiv.org/abs/1705.00075
Recommendations
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12)
Cites Work
Cited In (8)
- On diregular digraphs with degree two and excess three
- On digraphs of excess one
- Title not available (Why is that?)
- The structure of digraphs with excess one
- Minimum Diameter of Diregular Digraphs of Degree 2
- Turán problems for \(k\)-geodetic digraphs
- Digraphs with degree two and excess two are diregular
- On \(k\)-geodetic digraphs with excess one
This page was built for publication: On diregular digraphs with degree two and excess two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701129)