✦ LIBER ✦

Semi-regular graph automorphisms and generalized quadrangles

✍ Scribed by Mark A Ronan

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 642 KB
Volume: 29
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(80)90026-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subquadrangle m-regular systems on gener

Subquadrangle m-regular systems on generalized quadrangles

✍ Antonio Cossidente; Tim Penttila 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

We introduce the notion of subquadrangle regular system of a generalized quadrangle. A subquadrangle regular system of order m on a generalized quadrangle of order (s, t) is a set R of embedded subquadrangles with the property that every point lies on exactly m subquadrangles of R. If m is one half

Almost 2-Homogeneous Graphs and Complete

Almost 2-Homogeneous Graphs and Completely Regular Quadrangles

✍ Hiroshi Suzuki 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 203 KB

Regular graphs constructed from the clas

Regular graphs constructed from the classical generalized quadrangle Q(4, q)

✍ L. Beukemann; K. Metsch 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

Let c k be the smallest number of vertices in a regular graph with valency k and girth 8. It is known that c k+1 ≥ 2(1+k+k 2 +k 3 ) with equality if and only if there exists a finite generalized quadrangle of order k. No such quadrangle is known when k is not a prime power. In this case, small regul

k-regular factors and semi-k-regular fac

k-regular factors and semi-k-regular factors in bipartite graphs

✍ Keiko Kotani 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 418 KB

Regularity and the generalized adjacency

Regularity and the generalized adjacency spectra of graphs

✍ Andrey A. Chesnokov; Willem H. Haemers 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Fast generation of regular graphs and co

Fast generation of regular graphs and construction of cages

✍ Meringer, Markus 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 2 views

The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. In this article an efficient algorithm to generate regular graphs with a given number of vertices and vertex degree is introduced. The method is based on orderly genera