On Edge-Transitive Graphs of Square-Free Order
Copyright policy )On Edge-Transitive Graphs of Square-Free Order
We study the class of edge-transitive graphs of square-free order and valency at most $k$. It is shown that, except for a few special families of graphs, only finitely many members in this class are basic (namely, not a normal multicover of another member). Using this result, we determine the automorphism groups of locally primitive arc-transitive graphs with square-free order.
- Nankai University China (People's Republic of)
arc-transitive graph, almost simple group, Finite automorphism groups of algebraic, geometric, or combinatorial structures, edge-transitive graph, quasiprimitive permutation group, stabilizer, Graphs and abstract algebra (groups, rings, fields, etc.)
arc-transitive graph, almost simple group, Finite automorphism groups of algebraic, geometric, or combinatorial structures, edge-transitive graph, quasiprimitive permutation group, stabilizer, Graphs and abstract algebra (groups, rings, fields, etc.)
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).4 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).Average 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!