✦ LIBER ✦

A Classification of Symmetric Graphs of Order 3p

✍ Scribed by R.J. Wang; M.Y. Xu

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 761 KB
Volume: 58
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian paths in vertex-symmetric gr

Hamiltonian paths in vertex-symmetric graphs of order 4p

✍ Dragan Marušič; T.D. Parsons 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 562 KB

It is shown that every connected vertex-symmetric graph of order 4p (p a prime) has a Hamiltonian path. ## 1. Il#aoductjon L. Lovasz has conjectured that every connected vertex-symmetric graph (cvsg) has a Hamiltonian path. This conjecture has been verified for graphs of order p, 2p, 3p, p2, and p

Hamiltonian cycles in vertex symmetric g

Hamiltonian cycles in vertex symmetric graphs of order 2P2

✍ Dragan Marušič 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 365 KB

We prove that every connected vertex symmetric graph of order 2p 2, where p is a prime, is Hamiltonian.

Symmetric Graphs of Order a Product of T

Symmetric Graphs of Order a Product of Two Distinct Primes

✍ C.E. Praeger; R.J. Wang; M.Y. Xu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 830 KB

Cubic s-regular graphs of order 2p3

✍ Yan-Quan Feng; Jin Ho Kwak; Ming-Yao Xu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract A graph is __s‐regular__ if its automorphism group acts regularly on the set of its __s__‐arcs. Malnič et al. (Discrete Math 274 (2004), 187–198) classified the connected cubic edge‐transitive, but not vertex‐transitive graphs of order 2__p__^3^ for each prime __p__. In this article, we

A classification of all symmetric block

A classification of all symmetric block designs of order nine with an automorphism of order six

✍ Dean Crnković; Sanja Rukavina; Marcel Schmidt 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

## Abstract We complete the classification of all symmetric designs of order nine admitting an automorphism of order six. As a matter of fact, the classification for the parameters (35,17,8), (56,11,2), and (91,10,1) had already been done, and in this paper we present the results for the parameters

Constructing a Class of Symmetric Graphs

✍ Sanming Zhou 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 208 KB

We find a natural construction of a large class of symmetric graphs from point-and block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B, C of B, eithe