On the structure of digraphs with order close to the Moore bound

DOI10.1007/s003730050019zbMath0905.05033OpenAlexW2059514336MaRDI QIDQ1393025

Mirka Miller, Edy Tri Baskoro, Ján Plesník

Publication date: 2 August 1998

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050019

zbMATH Keywords

cycledigraphdiameterMoore boundMoore graphs

Mathematics Subject Classification ID

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

Related Items (13)

Eulogy for Professor Mirka Miller (1949--2016) ⋮ On mixed almost Moore graphs of diameter two ⋮ Multipartite Moore digraphs ⋮ Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats ⋮ On the nonexistence of almost Moore digraphs ⋮ Enumerations of vertex orders of almost Moore digraphs with selfrepeats ⋮ Distances of centroid sets in a graph-based construction for information security applications ⋮ On the nonexistence of almost Moore digraphs of degree four and five ⋮ On the weak distance-regularity of Moore-type digraphs ⋮ On the existence of \((d,k)\)-digraphs ⋮ Subdigraphs of almost Moore digraphs induced by fixpoints of an automorphism ⋮ Ideal basis in constructions defined by directed graphs ⋮ Divisibility conditions in almost Moore digraphs with selfrepeats

This page was built for publication: On the structure of digraphs with order close to the Moore bound