Constructing Infinite One-regular Graphs
Copyright policy )Constructing Infinite One-regular Graphs
A graph \(X\) is said to be one-regular if the automorphism group of \(X\) acts regularly on the set of arcs of \(X\). The authors consider infinite one-regular graphs. Starting with an infinite family of finite one-regular graphs of valency 4, for each member of this family an infinite one-regular graph is constructed. These graphs are Cayley graphs of almost abelian groups and represent a subclass of graphs with polynomial growth.
- University of Ljubljana Slovenia
- University of Leoben Austria
one-regular graphs, Computational Theory and Mathematics, automorphism group, Geometry and Topology, Cayley graphs, Graphs and abstract algebra (groups, rings, fields, etc.), Theoretical Computer Science
one-regular graphs, Computational Theory and Mathematics, automorphism group, Geometry and Topology, Cayley graphs, Graphs and abstract algebra (groups, rings, fields, etc.), Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).24 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!