Tetravalent edge-transitive graphs of girth at most 4

Primož Potočnik, Stephen E Wilson

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

This is the first in the series of articles stemming from a systematical investigation of finite edge-transitive tetravalent graphs, undertaken recently by the authors. In this article, we study a special but important case in which the girth of such graphs is at most 4. In particular, we show that, except for a single arc-transitive graph on 14 vertices, every edge-transitive tetravalent graph of girth at most 4 is the skeleton of an arc-transitive map on the torus or has one of these two properties: (1)there exist two vertices sharing the same neighbourhood,(2)every edge belongs to exactly one girth cycle. Graphs with property (1) or (2) are then studied further. It is shown that they all arise either as subdivided doubles of smaller arc-transitive tetravalent graphs, or as line graphs of triangle-free (G, 1)-regular and (G, 2)-arc-transitive cubic graphs, or as partial line graphs of certain cycle decompositions of smaller tetravalent graphs.

Original languageEnglish (US)
Pages (from-to)217-236
Number of pages20
JournalJournal of Combinatorial Theory. Series B
Volume97
Issue number2
DOIs
StatePublished - Mar 2007

Fingerprint

Edge-transitive Graph
Arc-transitive Graph
Girth
Line Graph
Decomposition
Graph in graph theory
Cycle Decomposition
Triangle-free
Cubic Graph
Finite Graph
Skeleton
Torus
Sharing
Arc of a curve
Partial
Cycle
Series

Keywords

  • Automorphism group
  • Cycle decomposition
  • Edge-transitive graphs
  • Graph
  • Linking ring structure
  • Locally arc-transitive graph
  • Semisymmetric graph
  • Symmetry
  • Tetravalent graphs

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Tetravalent edge-transitive graphs of girth at most 4. / Potočnik, Primož; Wilson, Stephen E.

In: Journal of Combinatorial Theory. Series B, Vol. 97, No. 2, 03.2007, p. 217-236.

Research output: Contribution to journalArticle

@article{0e65e20f4149459a8fb9b50c48fee738,
title = "Tetravalent edge-transitive graphs of girth at most 4",
abstract = "This is the first in the series of articles stemming from a systematical investigation of finite edge-transitive tetravalent graphs, undertaken recently by the authors. In this article, we study a special but important case in which the girth of such graphs is at most 4. In particular, we show that, except for a single arc-transitive graph on 14 vertices, every edge-transitive tetravalent graph of girth at most 4 is the skeleton of an arc-transitive map on the torus or has one of these two properties: (1)there exist two vertices sharing the same neighbourhood,(2)every edge belongs to exactly one girth cycle. Graphs with property (1) or (2) are then studied further. It is shown that they all arise either as subdivided doubles of smaller arc-transitive tetravalent graphs, or as line graphs of triangle-free (G, 1)-regular and (G, 2)-arc-transitive cubic graphs, or as partial line graphs of certain cycle decompositions of smaller tetravalent graphs.",
keywords = "Automorphism group, Cycle decomposition, Edge-transitive graphs, Graph, Linking ring structure, Locally arc-transitive graph, Semisymmetric graph, Symmetry, Tetravalent graphs",
author = "Primož Potočnik and Wilson, {Stephen E}",
year = "2007",
month = "3",
doi = "10.1016/j.jctb.2006.03.007",
language = "English (US)",
volume = "97",
pages = "217--236",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Tetravalent edge-transitive graphs of girth at most 4

AU - Potočnik, Primož

AU - Wilson, Stephen E

PY - 2007/3

Y1 - 2007/3

N2 - This is the first in the series of articles stemming from a systematical investigation of finite edge-transitive tetravalent graphs, undertaken recently by the authors. In this article, we study a special but important case in which the girth of such graphs is at most 4. In particular, we show that, except for a single arc-transitive graph on 14 vertices, every edge-transitive tetravalent graph of girth at most 4 is the skeleton of an arc-transitive map on the torus or has one of these two properties: (1)there exist two vertices sharing the same neighbourhood,(2)every edge belongs to exactly one girth cycle. Graphs with property (1) or (2) are then studied further. It is shown that they all arise either as subdivided doubles of smaller arc-transitive tetravalent graphs, or as line graphs of triangle-free (G, 1)-regular and (G, 2)-arc-transitive cubic graphs, or as partial line graphs of certain cycle decompositions of smaller tetravalent graphs.

AB - This is the first in the series of articles stemming from a systematical investigation of finite edge-transitive tetravalent graphs, undertaken recently by the authors. In this article, we study a special but important case in which the girth of such graphs is at most 4. In particular, we show that, except for a single arc-transitive graph on 14 vertices, every edge-transitive tetravalent graph of girth at most 4 is the skeleton of an arc-transitive map on the torus or has one of these two properties: (1)there exist two vertices sharing the same neighbourhood,(2)every edge belongs to exactly one girth cycle. Graphs with property (1) or (2) are then studied further. It is shown that they all arise either as subdivided doubles of smaller arc-transitive tetravalent graphs, or as line graphs of triangle-free (G, 1)-regular and (G, 2)-arc-transitive cubic graphs, or as partial line graphs of certain cycle decompositions of smaller tetravalent graphs.

KW - Automorphism group

KW - Cycle decomposition

KW - Edge-transitive graphs

KW - Graph

KW - Linking ring structure

KW - Locally arc-transitive graph

KW - Semisymmetric graph

KW - Symmetry

KW - Tetravalent graphs

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

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

U2 - 10.1016/j.jctb.2006.03.007

DO - 10.1016/j.jctb.2006.03.007

M3 - Article

AN - SCOPUS:33846160597

VL - 97

SP - 217

EP - 236

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -