






















In a simple graph, a shunt is a symmetry which sends an edge to an incident edge (without fixing their shared vertex). The orbit of this edge under the shunt forms a consistent cycle. The important theorem of Biggs and Conway says that in a dart-transitive graph of valence q, there are exactly q-1 orbits of consistent cycles. These ideas have become a useful tool in the area of graphs symmetries, and generalize easily to consistent walks in graphs which are not simple. These walks are not necessarily cycles, or even circuits. This paper considers these walks and their orbits in the venue of dart-transitive maps and classifies them geometrically.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。