✦ LIBER ✦

An infinite family of biprimitive semisymmetric graphs

✍ Scribed by Du, Shao-Fei; Maru??i??, Dragan

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 296 KB
Volume: 32
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199911)32:3<217::aid-jgt1>3.0.co;2-m

No coin nor oath required. For personal study only.

✦ Synopsis

A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these two parts. A semisymmetric graph is called biprimitive, if its automorphism group acts primitively on each part. In this article, a clas- sification of biprimitive semisymmetric graphs arising from the action of the group P SL(2, p), p ≡ ±1(mod 8) a prime, acting on cosets of S 4 is given, resulting in

📜 SIMILAR VOLUMES

Note on Infinite Families of Trivalent S

Note on Infinite Families of Trivalent Semisymmetric Graphs

✍ Seymour Lipschutz; Ming-Yao Xu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 60 KB

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper uses the groups PSL(2, p) and PGL(2, p), where p is a prime, to construct two new infinite families of trivalent semisymmetric graphs.

Constructing an Infinite Family of Cubic

Constructing an Infinite Family of Cubic 1-Regular Graphs

✍ Yan-Quan Feng; Jin Ho Kwak 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 89 KB

A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J. Comb. Theory, B, 10 (1971), 163-182] constructed an infinite family of cubic 1-regular graphs of order 2 p, where p ≥ 13 is a prime congruent to 1 modulo 3. Marušič and Xu [J. Graph Theory, 25 (1997), 13

On chromatic uniqueness of two infinite

On chromatic uniqueness of two infinite families of graphs

✍ Feng-Ming Dong 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB 👁 1 views

## Abstract In this paper, it is proven that for each __k__ ≥ 2, __m__ ≥ 2, the graph Θ~__k__~(__m,…,m__), which consists of __k__ disjoint paths of length __m__ with same ends is chromatically unique, and that for each __m, n__, 2 ≤ __m__ ≤ __n__, the complete bipartite graph __K__~__m,n__~ is chr

An infinite class of reach-preservable g

An infinite class of reach-preservable graphs

✍ Gagliardi, Daniel; Lewinter, Marty 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 42 KB 👁 1 views

for all w in G. G is called reach-preservable if each of its spanning trees contains at least one reachpreserving vertex. We show that K 2,n is reach-preservable. We show that a graph is bipartite if and only if given any pair of vertices, there exists a spanning tree in which both vertices a reach-

Infinite families of 4-chromatic Grötzsc

Infinite families of 4-chromatic Grötzsch-Sachs graphs

✍ Andrey A. Dobrynin; Leonid S. Mel'nikov 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

## Abstract Let __G__ be a 4‐regular planar graph and suppose that __G__ has a cycle decomposition __S__ (i.e., each edge of __G__ is in exactly one cycle of the decomposition) with every pair of adjacent edges on a face always in different cycles of __S__. Such graphs, called Grötzsch‐Sachs graphs

An infinite family of (simple) 6-designs

✍ Donald L. Kreher 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB 👁 1 views

A simple 6-(22,8,60) designs is exhibited. It is then shown using Qui-rong Wu's generalization of a result of Luc Teirlinck that this design together with our 6-(14,7,4) design implies the existence of simple 6-(23 + 16m,8,4(m + I) (16m + 17)) designs for all positive integers m. All the above ment