✦ LIBER ✦

Semi-regular relations and digraphs

✍ Scribed by S.A Choudum; K.R Parthasarathy

Book ID: 108046818
Publisher: Elsevier Science
Year: 1972
Weight: 477 KB
Volume: 75
Category: Article
ISSN: 1385-7258
DOI: 10.1016/1385-7258(72)90047-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weakly distance-regular digraphs

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

Doubly regular asymmetric digraphs

✍ Noboru Ito 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 284 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

The line digraph of a regular and pancir

The line digraph of a regular and pancircular digraph is also regular and pancircular

✍ Masatosi Imori; Makoto Matsumoto; Hisao Yamada 📂 Article 📅 1988 🏛 Springer Japan 🌐 English ⚖ 249 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

Maximum diameter of regular digraphs

✍ Josè Soares 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 512 KB

## Abstract We prove that every __r__‐biregular digraph with __n__ vertices has its directed diamter bounded by (3__n__ ‐ __r__ ‐ 3)/(__r__ +1). We show that this bound is tight for directed as well as for undirected graphs. The upper bound remains valid for Eulerian digraphs with minimum outdegree