On Diregularity of Digraphs of Defect at Most Two
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F09%3A00503056" target="_blank" >RIV/49777513:23520/09:00503056 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On Diregularity of Digraphs of Defect at Most Two
Original language description
It is easy to show that any digraph with out-degree at most d, diameter k at least 2 and order one or two less than Moore bound must have all vertices of out-degree d. However, establishing the regularity or otherwise of the in-degree of such a digraph is not easy. In this paper we prove that all digraphs of defect two are either diregular or almost diregular. Additionally, in the case of defect one we present a new, simpler and shorter, proof that a digraph of defect one must be diregular, and in the case of defect two and for d = 2 and k at least 3, we present an alternative proof that a digraph of defect two must be diregular.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Combinatorial Mathematics and Combinatorial Computing
ISSN
0835-3026
e-ISSN
—
Volume of the periodical
71
Issue of the periodical within the volume
1
Country of publishing house
CA - CANADA
Number of pages
18
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—