A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.
β¦ LIBER β¦
Regular graphs with excess one
β Scribed by Eiichi Bannai; Tatsuro Ito
- Book ID
- 107748377
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 950 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Constructing Infinite One-regular Graphs
β
Aleksander MalniΔ; Dragan MaruΕ‘iΔ; Norbert Seifter
π
Article
π
1999
π
Elsevier Science
π
English
β 134 KB
On graphs with regular groups
β
Wilfried Imrich
π
Article
π
1975
π
Elsevier Science
π
English
β 466 KB
Clustering with -regular graphs
β
Jong Kyoung Kim; Seungjin Choi
π
Article
π
2009
π
Elsevier Science
π
English
β 402 KB
One-factorizations of complete graphs wi
β
Arrigo Bonisoli; Domenico Labbate
π
Article
π
2001
π
John Wiley and Sons
π
English
β 161 KB
## Abstract We consider oneβfactorizations of __K__~2__n__~ possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of oneβfactors which are fixed by the group; further information is obtained when equality holds in these boun
Distance-Regular Graphs with Strongly Re
β
Anna Kasikova
π
Article
π
1997
π
Springer
π
English
β 87 KB
Regular languages with variables on grap
β
Simone Santini
π
Article
π
2012
π
Elsevier Science
π
English
β 345 KB