✦ LIBER ✦

Distance-transitive graphs of valency 5, 6 and 7

✍ Scribed by A.A. Ivanov; A.V. Ivanov; I.A. Faradzhev

Publisher: Elsevier Science
Year: 1984
Weight: 964 KB
Volume: 24
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(84)90010-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex-transitive graphs: Symmetric grap

Vertex-transitive graphs: Symmetric graphs of prime valency

✍ Peter Lorimer 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 642 KB

Let G be a group acting symmetrically on a graph 2, let G, be a subgroup of G minimal among those that act symmetrically on 8, and let G2 be a subgroup of G, maximal among those normal subgroups of GI which contain no member except 1 which fixes a vertex of Z. The most precise result of this paper i

Maps and Half-transitive Graphs of Valen

Maps and Half-transitive Graphs of Valency 4

✍ D Marušič; R Nedela 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 167 KB

A subgroup G of automorphisms of a graph X is said to be 1 2 -transitive if it is vertex-and edge-but not arc-transitive. The graph X is said to be 1 2 -transitive if Aut X is 1 2 -transitive. The correspondence between regular maps and 1 2 -transitive group actions on graphs of valency 4 is studied

Half-transitive graphs of valency 4 with

Half-transitive graphs of valency 4 with prescribed attachment numbers

✍ Maru?i?, Dragan; Waller, Adrian O. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 2 views

A graph X is said to be 1 2 -transitive if its automorphism group Aut X acts vertex-and edge-, but not arc-transitively on X. Then Aut X induces an orientation of the edges of X. If X has valency 4, then this orientation gives rise to so-called alternating cycles, that is even length cycles in X who

The smallest graph of girth 6 and valenc

The smallest graph of girth 6 and valency 7

✍ M. O'Keefe; P. K. Wong 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

## Abstract With the aid of a computer. we give a regular graph of girth 6 and valency 7, which has 90 vertices and show that this is the unique smallest graph with these properties.

A smallest graph of girth 5 and valency

A smallest graph of girth 5 and valency 6

✍ M O'Keefe; Pak-Ken Wong 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 309 KB

Edge-reconstruction of planar graphs wit

Edge-reconstruction of planar graphs with minimum valency 5

✍ Josef Lauri 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 780 KB

## Abstract The object of this paper is to show tht every planar graph of minimum valency 5 is reconstructible from its family of edge‐deleted subgraphs.