Abstract | ||
---|---|---|
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. (C) 1999 Academic Press. |
Year | DOI | Venue |
---|---|---|
1999 | 10.1006/eujc.1999.0338 | Eur. J. Comb. |
Keywords | Field | DocType |
infinite one-regular graph,abelian group,cayley graph,regular graph | Graph automorphism,Odd graph,Discrete mathematics,Indifference graph,Combinatorics,Vertex-transitive graph,Chordal graph,Symmetric graph,1-planar graph,Universal graph,Mathematics | Journal |
Volume | Issue | ISSN |
20 | 8 | 0195-6698 |
Citations | PageRank | References |
13 | 1.51 | 9 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Aleksander Malnic | 1 | 324 | 31.54 |
Dragan Marušič | 2 | 612 | 77.94 |
N Seifter | 3 | 137 | 26.49 |