✦ LIBER ✦

Vertex-symmetric graphs with preassigned degree and girth

✍ Scribed by D. V. Znoiko

Publisher: SP MAIK Nauka/Interperiodica
Year: 1983
Tongue: English
Weight: 175 KB
Volume: 33
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01158291

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with prescribed degree sets and g

Graphs with prescribed degree sets and girth

✍ G. Chartrand; R. J. Gould; S. F. Kapoor 📂 Article 📅 1981 🏛 Springer Netherlands 🌐 English ⚖ 319 KB

Extraconnectivity of graphs with large m

Extraconnectivity of graphs with large minimum degree and girth

✍ C. Balbuena; A. Carmona; J. Fàbrega; M.A. Fiol 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 824 KB

Graphs of Prescribed Girth and Bi-Degree

✍ Z. Furedi; F. Lazebnik; A. Seress; V.A. Ustimenko; A.J. Woldar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Small vertex-transitive and Cayley graph

Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach

✍ Eyal Loz; Martin Mačaj; Mirka Miller; Jana Šiagiová; Jozef Širáň; Jana Tomanová 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

We examine the existing constructions of the smallest known vertex-transitive graphs of a given degree and girth 6. It turns out that most of these graphs can be described in terms of regular lifts of suitable quotient graphs. A further outcome of our analysis is a precise identification of which of

Decomposing graphs with girth at least f

Decomposing graphs with girth at least five under degree constraints

✍ Diwan, Ajit A. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 2 views

We prove that the vertex set of a simple graph with minimum degree at least s + t -1 and girth at least 5 can be decomposed into two parts, which induce subgraphs with minimum degree at least s and t, respectively, where s, t are positive integers ≥ 2.

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