✦ LIBER ✦

A class of vertex-transitive digraphs

✍ Scribed by Chong-Yun Chao; Jacqueline G Wells

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 571 KB
Volume: 14
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90007-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 labeled vertex-transitive digraphs wi

On labeled vertex-transitive digraphs with a prime number of vertices

✍ Chong-Yun Chao; Jacqueline G. Wells 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 481 KB

## We enumerate, up to isomorphism, several classes of labeled vertex-transitive digraphs with a prime number of vertices. There are many unsolvedi enumeration problems stated in [S]. Recently, Robinson in [8] posed more enumeration problems. Here, we give some partial answer to the problems posed

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

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 non-Cayley vertex- transitive

A class of non-Cayley vertex- transitive graphs associated with PSL(2,p)

✍ Dragan Marušič; Raffaele Scapellato 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 851 KB

MaruSiE, D. and R. Scapellato, A class of non-Cayley vertex-transitive graphs associated with PSL(2, p), Discrete Mathematics 109 (1992) 161-170. A construction for a class of non-Cayley vertex-transitive graphs associated with PSL(2,p) acting by right multiplication on the right cosets of a dihedr