𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complete characterization of almost Moore digraphs of degree three

✍ Scribed by Edy Tri Baskoro; Mirka Miller; Jozef Širáň; Martin Sutton

Book ID
102343530
Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
169 KB
Volume
48
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Digraphs of degree 3 and order close to
Digraphs of degree 3 and order close to the moore bound
✍ Edy Tri Baskoro; Mirka Miller; Ján Plesník; Štefan Znám 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

## Abstract It is known tht __Moore__ digraphs of degree __d__ > 1 and diameter __k__ > 1 do not exist (see [20] or [5]). Furthermore, for degree 2, it is shown tht for __l__ ≥ 3 there are no digraphs of order “close” to, i.e., one less than __Moore__ bound [18]. In this paper, we shall consider di

Characterization of c-circulant digraphs
Characterization of c-circulant digraphs of degree two which are circulant
✍ J.M. Brunat; M. Maureso; M. Mora 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 796 KB

A c-circulant digraph G,(c, A) has Z,V as its vertex set and adjacency rules given by .X + cs + a with a E A c Z,. The c-circulant digraphs of degree two which are isomorphic to some circulant digraph are characterized, and the corresponding isomorphism is given. Moreover. a sufficient condition is

Characterizations of vertex pancyclic an
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
✍ G. Gutin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 527 KB

A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a complete multipartite graph. Such a digraph D is called ordinary if for any pair X, Y of its partite sets the set of arcs with both end vert