Doubly regular asymmetric digraphs
β Scribed by Noboru Ito
- Book ID
- 103059455
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 284 KB
- Volume
- 72
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
## 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