𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Vosperian and Superconnected Vertex-Transitive Digraphs

✍ Scribed by Y. O. Hamidoune, A. Lladó, S. C. López

Book ID
120788658
Publisher
Springer Japan
Year
2011
Tongue
English
Weight
164 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Permutation Groups, Vertex-transitive Di
Permutation Groups, Vertex-transitive Digraphs and Semiregular Automorphisms
✍ D. Maru s̆c̆; R. Scapellato 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 120 KB

A nonidentity element of a permutation group is said to be semiregular if all of its orbits have the same length. The work in this paper is linked to [6] where the problem of existence of semiregular automorphisms in vertex-transitive digraphs was posed. It was observed there that every vertextransi

On Hamiltonicity of Vertex-Transitive Gr
On Hamiltonicity of Vertex-Transitive Graphs and Digraphs of Orderp4
✍ Yu Qing Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 352 KB

The main result of this paper is that vertex-transitive graphs and digraphs of order p 4 are Hamiltonian, where p is a prime number. 1998 Academic Press 1. INTRODUCTION Witte [7] proved that Cayley digraphs of finite p-groups are Hamiltonian. In [2], Marus$ ic$ showed that all vertex-transitive digr

A class of self-complementary vertex-tra
A class of self-complementary vertex-transitive digraphs
✍ Gek-Ling Chia; Chong-Keang Lim 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

We characterize the class of self-complementary vertex-transitive digraphs on a prime number p of vertices. Using this, we enumerate (i) self-complementary strongly vertex-transitive digraphs on p vertices, (ii) self-complementary vertex-transitive digraphs on p vertices, (iii) selfcomplementary ver

Vertex heaviest paths and cycles in quas
Vertex heaviest paths and cycles in quasi-transitive digraphs
✍ Jørgen Bang-Jensen; Gregory Gutin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 381 KB

A digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct vertices of D such that (x,y) and (y,z) are arcs of D there is at least one at': from x to z or from z to x. Solving a conjecture by Bangdensen and Huang (1995), Gutin (1995) described polynomial algorithms fo