✦ LIBER ✦

Note on Infinite Families of Trivalent Semisymmetric Graphs

✍ Scribed by Seymour Lipschutz; Ming-Yao Xu

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 60 KB
Volume: 23
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2002.0594

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

An infinite family of biprimitive semisy

An infinite family of biprimitive semisymmetric graphs

✍ Du, Shao-Fei; Maru??i??, Dragan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB 👁 1 views

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 biprimiti

A Note on Intertwines of Infinite Graphs

✍ B. Oporowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 224 KB

We present a construction of two infinite graphs \(G_{1}, G_{2}\) and of an infinite set of graphs such that \(\mathscr{F}\) is an antichain with respect to the minor relation and, for every graph \(G\) in \(\mathscr{F}\), both \(G_{1}\) and \(G_{2}\) are subgraphs of \(G\) but no graph obtained fro

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

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

A Note on the Existence of Certain Infin

A Note on the Existence of Certain Infinite Families of Imaginary Quadratic Fields

✍ Dongho Byeon 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Let Do0 be the fundamental discriminant of an imaginary quadratic field, and hðDÞ its class number. In this paper, we show that for any prime p > 3 and e ¼ À1; 0; or 1, ] ÀX oDo0 j hðDÞc0 ðmod pÞ and D p ¼ e 4 p ffiffiffiffi X p log X :

On self-immersions of infinite graphs

✍ Thomas Andreae 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

## Abstract The existence of an infinite graph which is not isomorphic to a proper minor of itself was proved by Oporowski. In the present note, it is shown that an analogous result holds when immersions are considered instead of minors. The question whether or not the same is true for weak immersi