On the nonexistence of almost Moore digraphs of degree four and five

DOI10.1007/s11786-015-0219-zzbMath1317.05070OpenAlexW619086812MaRDI QIDQ2516496

Josep Conde, Kumar Saurav, Josep M. Miret Biosca, Mirka Miller

Publication date: 3 August 2015

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-015-0219-z

zbMATH Keywords

irreducibility of polynomialsalmost Moore digraphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats

Cites Work

• 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 the structure of digraphs with order close to the Moore bound
• Nonexistence of almost Moore digraphs of diameter four
• Almost Moore digraphs are diregular
• Complete characterization of almost Moore digraphs of degree three

This page was built for publication: On the nonexistence of almost Moore digraphs of degree four and five