✦ LIBER ✦

A class of self-complementary vertex-transitive digraphs

✍ Scribed by Gek-Ling Chia; Chong-Keang Lim

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 312 KB
Volume: 10
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190100213

No coin nor oath required. For personal study only.

✦ Synopsis

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 vertex-transitive graphs on p vertices. Finally it is shown that every self-complementary vertex-transitive digraph on p vertices is either a tournament or a graph.

📜 SIMILAR VOLUMES

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

Vertex-transitive graphs that remain con

Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors

✍ Y. O. Hamidoune; A. Lladó; S. C. López 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

A d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex and its neighbors will be called vosperian. Let be a vertex-transitive graph of

A class of self-complementary graphs and

A class of self-complementary graphs and lower bounds of some ramsey numbers

✍ C. R. J. Clapham 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 1 views

## Abstract A method is described of constructing a class of self‐complementary graphs, that includes a self‐complementary graph, containing no __K__~5~, with 41 vertices and a self‐complementary graph, containing no __K__~7~, with 113 vertices. The latter construction gives the improved Ramsey num

Enumeration and generation of a class of

Enumeration and generation of a class of regular digraphs

✍ M. V. S. Ramanath; T. R. Walsh 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

We study the class of directed graphs that have indegree = outdegree = 2 a t every vertex. These digraphs can be decomposed uniquely into "alternating cycles"; w e use this decomposition to present efficient techniques for counting and generating them. The number (up to isomorphism) of these digraph

On a Class of Doubly Transitive ω-Stable

On a Class of Doubly Transitive ω-Stable Groups

✍ A. Borovik; M.J. Debonis; A. Nesin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 479 KB

On Non-Cayley Vertex-Transitive Graphs o

On Non-Cayley Vertex-Transitive Graphs of Order a Product of Three Primes

✍ Mohammad A. Iranmanesh; Cheryl E. Praeger 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 192 KB

This paper completes the determination of all integers of the form pqr (where p, q, and r are distinct primes) for which there exists a vertex-transitive graph on pqr vertices which is not a Cayley graph.