✦ LIBER ✦

Weakly distance-regular digraphs

✍ Scribed by F. Comellas; M.A. Fiol; J. Gimbert; M. Mitjana

Book ID: 108167357
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 345 KB
Volume: 90
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2003.07.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Spectrum of a Weakly Distance-Reg

On the Spectrum of a Weakly Distance-Regular Digraph

✍ F. Comellas; M.A. Fiol; J. Gimbert; M. Mitjana 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Distance-regular digraphs of girth 4

✍ H Enomoto; R.A Mena 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 391 KB

Certain distance-regular digraphs and re

Certain distance-regular digraphs and related rings of characteristic 4

✍ R.A Liebler; R.A Mena 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 605 KB

Distance transitive digraphs

✍ Clement W.H. Lam 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 980 KB

A digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v) = d(x, y) there is an automorphism w of the digraph such that T(U) = x and T(V) = y. Some examples of distance-transitive digraphs are given in Section 2. Section 3 defines the intersection matrix and gives

Doubly regular asymmetric digraphs

✍ Noboru Ito 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Regular embeddings of coloured digraphs

✍ Attilia Ceré 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 450 KB

A particular kind of 2-ceU embeddings, called regular, for arc-coloured digraphs is introduced, and a method for constructing both orientable and non-orientable regular embeddings is presented. Furthermore, by using combinatorial concepts and the Euler-Poincar6 formula, we derive upper bounds for bo