Consistent cycles in graphs and digraphs

Štefko Miklavič, Primož Potočnik, Stephen E Wilson

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle [InlineMediaObject not available: see fulltext.] of Γ is called G-consistent whenever there is an element of G whose restriction to [InlineMediaObject not available: see fulltext.] is the 1-step rotation of [InlineMediaObject not available: see fulltext.]. Consistent cycles in finite arc-transitive graphs were introduced by J. H. Conway in his public lectures at the Second British Combinatorial Conference in 1971. He observed that the number of G-orbits of G-consistent cycles of an arc-transitive group G is precisely one less than the valency of the graph. In this paper, we give a detailed proof of this result in a more general setting of arbitrary groups of automorphisms of graphs and digraphs.

Original languageEnglish (US)
Pages (from-to)205-216
Number of pages12
JournalGraphs and Combinatorics
Volume23
Issue number2
DOIs
StatePublished - Apr 2007

Fingerprint

Digraph
Orbits
Cycle
Graph in graph theory
Arc-transitive Graph
Finite Graph
Automorphism Group
Automorphisms
Arc of a curve
Orbit
Subgroup
Restriction
Arbitrary

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

Consistent cycles in graphs and digraphs. / Miklavič, Štefko; Potočnik, Primož; Wilson, Stephen E.

In: Graphs and Combinatorics, Vol. 23, No. 2, 04.2007, p. 205-216.

Research output: Contribution to journalArticle

Miklavič, Štefko ; Potočnik, Primož ; Wilson, Stephen E. / Consistent cycles in graphs and digraphs. In: Graphs and Combinatorics. 2007 ; Vol. 23, No. 2. pp. 205-216.
@article{34ea3b13459a4ac789799622aa3d67fc,
title = "Consistent cycles in graphs and digraphs",
abstract = "Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle [InlineMediaObject not available: see fulltext.] of Γ is called G-consistent whenever there is an element of G whose restriction to [InlineMediaObject not available: see fulltext.] is the 1-step rotation of [InlineMediaObject not available: see fulltext.]. Consistent cycles in finite arc-transitive graphs were introduced by J. H. Conway in his public lectures at the Second British Combinatorial Conference in 1971. He observed that the number of G-orbits of G-consistent cycles of an arc-transitive group G is precisely one less than the valency of the graph. In this paper, we give a detailed proof of this result in a more general setting of arbitrary groups of automorphisms of graphs and digraphs.",
author = "Štefko Miklavič and Primož Potočnik and Wilson, {Stephen E}",
year = "2007",
month = "4",
doi = "10.1007/s00373-007-0695-2",
language = "English (US)",
volume = "23",
pages = "205--216",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "2",

}

TY - JOUR

T1 - Consistent cycles in graphs and digraphs

AU - Miklavič, Štefko

AU - Potočnik, Primož

AU - Wilson, Stephen E

PY - 2007/4

Y1 - 2007/4

N2 - Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle [InlineMediaObject not available: see fulltext.] of Γ is called G-consistent whenever there is an element of G whose restriction to [InlineMediaObject not available: see fulltext.] is the 1-step rotation of [InlineMediaObject not available: see fulltext.]. Consistent cycles in finite arc-transitive graphs were introduced by J. H. Conway in his public lectures at the Second British Combinatorial Conference in 1971. He observed that the number of G-orbits of G-consistent cycles of an arc-transitive group G is precisely one less than the valency of the graph. In this paper, we give a detailed proof of this result in a more general setting of arbitrary groups of automorphisms of graphs and digraphs.

AB - Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle [InlineMediaObject not available: see fulltext.] of Γ is called G-consistent whenever there is an element of G whose restriction to [InlineMediaObject not available: see fulltext.] is the 1-step rotation of [InlineMediaObject not available: see fulltext.]. Consistent cycles in finite arc-transitive graphs were introduced by J. H. Conway in his public lectures at the Second British Combinatorial Conference in 1971. He observed that the number of G-orbits of G-consistent cycles of an arc-transitive group G is precisely one less than the valency of the graph. In this paper, we give a detailed proof of this result in a more general setting of arbitrary groups of automorphisms of graphs and digraphs.

UR - http://www.scopus.com/inward/record.url?scp=34247253385&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247253385&partnerID=8YFLogxK

U2 - 10.1007/s00373-007-0695-2

DO - 10.1007/s00373-007-0695-2

M3 - Article

AN - SCOPUS:34247253385

VL - 23

SP - 205

EP - 216

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 2

ER -