On diregular digraphs with degree two and excess three

DOI10.1016/j.dam.2019.02.045zbMath1464.05168arXiv1710.00086OpenAlexW4210671776WikidataQ128184830 ScholiaQ128184830MaRDI QIDQ2026351

James Tuite

Publication date: 19 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.00086

zbMATH Keywords

digraphsexcessdegree/diameter problemextremal digraphs\(k\)-geodetic

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonexistence of almost Moore digraphs of diameter three
• On the impossibility of directed Moore graphs
• On the existence of \((d,k)\)-digraphs
• On digraphs of excess one
• On diregular digraphs with degree two and excess two
• Digraphs with degree two and excess two are diregular
• Digraphs of degree two which miss the Moore bound by two
• Nonexistence of almost Moore digraphs of diameter four
• On the girth of digraphs
• Dynamic cage survey
• On the nonexistence of almost Moore digraphs
• Moore graphs and beyond: a survey of the degree/diameter problem
• On Moore Graphs with Diameters 2 and 3
• Maximum degree in graphs of diameter 2
• Complete characterization of almost Moore digraphs of degree three
• Digraphs of degree 3 and order close to the moore bound
• On k-geodetic digraphs with excess one
• On minimal regular digraphs with given girth

This page was built for publication: On diregular digraphs with degree two and excess three