Linking rings structures and semisymmetric graphs: Combinatorial constructions

Primož Potočnik, Stephen E Wilson

Research output: Contribution to journalArticle

Abstract

This paper considers combinatorial methods of constructing LR structures: two isolated constructions, RC and SoP, two closely related constructions, CS(Γ, B, 0) and CS(Γ, B, 1) using cycle decompositions of tetravalent graphs, a generalization of those, CS(Γ, B, k) for k > 2, and finally a construction LDCS relating to cycle decompositions of graphs of higher even valence. This last construction is used to classify all LR structures of types (3, ∗) or (4, ∗).

Original languageEnglish (US)
Pages (from-to)1-17
Number of pages17
JournalArs Mathematica Contemporanea
Volume15
Issue number1
StatePublished - Jan 1 2018

Fingerprint

Semisymmetric Graph
Linking
Cycle Decomposition
Ring
Decomposition
Graph in graph theory
Classify

Keywords

  • Automorphism group
  • Cycle structure
  • Graph
  • Linking ring structure
  • Locally arc-transitive graph
  • Semisymmetric graph
  • Symmetry

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

Cite this

Linking rings structures and semisymmetric graphs : Combinatorial constructions. / Potočnik, Primož; Wilson, Stephen E.

In: Ars Mathematica Contemporanea, Vol. 15, No. 1, 01.01.2018, p. 1-17.

Research output: Contribution to journalArticle

@article{23a4163feda14e90a26981108f0705c2,
title = "Linking rings structures and semisymmetric graphs: Combinatorial constructions",
abstract = "This paper considers combinatorial methods of constructing LR structures: two isolated constructions, RC and SoP, two closely related constructions, CS(Γ, B, 0) and CS(Γ, B, 1) using cycle decompositions of tetravalent graphs, a generalization of those, CS(Γ, B, k) for k > 2, and finally a construction LDCS relating to cycle decompositions of graphs of higher even valence. This last construction is used to classify all LR structures of types (3, ∗) or (4, ∗).",
keywords = "Automorphism group, Cycle structure, Graph, Linking ring structure, Locally arc-transitive graph, Semisymmetric graph, Symmetry",
author = "Primož Potočnik and Wilson, {Stephen E}",
year = "2018",
month = "1",
day = "1",
language = "English (US)",
volume = "15",
pages = "1--17",
journal = "Ars Mathematica Contemporanea",
issn = "1855-3966",
publisher = "DMFA Slovenije",
number = "1",

}

TY - JOUR

T1 - Linking rings structures and semisymmetric graphs

T2 - Combinatorial constructions

AU - Potočnik, Primož

AU - Wilson, Stephen E

PY - 2018/1/1

Y1 - 2018/1/1

N2 - This paper considers combinatorial methods of constructing LR structures: two isolated constructions, RC and SoP, two closely related constructions, CS(Γ, B, 0) and CS(Γ, B, 1) using cycle decompositions of tetravalent graphs, a generalization of those, CS(Γ, B, k) for k > 2, and finally a construction LDCS relating to cycle decompositions of graphs of higher even valence. This last construction is used to classify all LR structures of types (3, ∗) or (4, ∗).

AB - This paper considers combinatorial methods of constructing LR structures: two isolated constructions, RC and SoP, two closely related constructions, CS(Γ, B, 0) and CS(Γ, B, 1) using cycle decompositions of tetravalent graphs, a generalization of those, CS(Γ, B, k) for k > 2, and finally a construction LDCS relating to cycle decompositions of graphs of higher even valence. This last construction is used to classify all LR structures of types (3, ∗) or (4, ∗).

KW - Automorphism group

KW - Cycle structure

KW - Graph

KW - Linking ring structure

KW - Locally arc-transitive graph

KW - Semisymmetric graph

KW - Symmetry

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

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

M3 - Article

AN - SCOPUS:85047311572

VL - 15

SP - 1

EP - 17

JO - Ars Mathematica Contemporanea

JF - Ars Mathematica Contemporanea

SN - 1855-3966

IS - 1

ER -