✦ LIBER ✦

Enumeration of almost Moore digraphs of diameter two

✍ Scribed by J. Gimbert

Book ID: 108315567
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 172 KB
Volume: 231
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00316-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumerations of vertex orders of almost

Enumerations of vertex orders of almost Moore digraphs with selfrepeats

✍ E.T. Baskoro; Y.M. Cholily; M. Miller 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 148 KB

The diameters of almost all Cayley digra

The diameters of almost all Cayley digraphs

✍ Jixiang Meng; Xin Liu 📂 Article 📅 1997 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 238 KB

Complete characterization of almost Moor

Complete characterization of almost Moore digraphs of degree three

✍ Edy Tri Baskoro; Mirka Miller; Jozef Širáň; Martin Sutton 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one. No

Almost Minimum Diameter Orientations of

Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs

✍ Gregory Gutin; Khee Meng Koh; Eng Guan Tay; Anders Yeo 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 110 KB

A generalization of Moore graphs of diam

A generalization of Moore graphs of diameter two

✍ R.C Bose; T.A Dowling 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 676 KB

Enumeration of Cayley graphs and digraph

Enumeration of Cayley graphs and digraphs

✍ Brian Alspach; Marni Mishna 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 137 KB