𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum diameter of regular digraphs

✍ Scribed by Josè Soares

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
512 KB
Volume
16
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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 r. © 1929 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

Diameter vulnerability of iterated line
Diameter vulnerability of iterated line digraphs
✍ C. Padró; P. Morillo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 823 KB

Because of their good properties, iterated line digraphs (specially Kautz and de Bruijn digraphs) have been considered to design interconnection networks. The diameter-vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a fixed number of vertices or arcs. For a

On the diameter vulnerability of Kautz d
On the diameter vulnerability of Kautz digraphs
✍ D.Z. Du; D.F. Hsu; Y.D. Lyuu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We show that in the Kautz digraph K(d, t) with d' + d'-1 vertices each having out degree d, there exist d vertex-disjoint paths between any pair of distinct vertices, one of length at most t, d -2 of length at most t + 1, and one of length at most t + 2.

Factors in a class of regular digraphs
Factors in a class of regular digraphs
✍ M. V. S. Ramanath 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB

For the class of 2-diregular digraphs: (1) We give a simple closed form expression-a power of 2-for the number of difactors. (2) For the adjacency matrices of these graphs, we show an intimate relationship between the permanent and determinant. (3) We give a necessary and sufficient condition for th

Distance regular graphs of diameter 3 an
Distance regular graphs of diameter 3 and strongly regular graphs
✍ A.E Brouwer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the

Digraphical Regular Representations of I
Digraphical Regular Representations of Infinite Finitely Generated Groups
✍ R.G. Möller; N. Seifter 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 104 KB

A directed Cayley graph X is called a digraphical regular representation (DRR) of a group G if the automorphism group of X acts regularly on X . Let S be a finite generating set of the infinite cyclic group Z. We show that a directed Cayley graph X (Z, S) is a DRR of Z if and only if As a general r