A worthy family of semisymmetric graphs

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

In this paper, we construct semisymmetric graphs in which no two vertices have exactly the same neighbors. We show how to do this by first considering bi-transitive graphs, and then we show how to choose two such graphs so that their product is regular. We display a family of bi-transitive graphs D N(a,b) which can be used for this purpose and we show that their products are semisymmetric by applying vectors due to Ivanov.

Original languageEnglish (US)
Pages (from-to)283-294
Number of pages12
JournalDiscrete Mathematics
Volume271
Issue number1-3
DOIs
StatePublished - Sep 28 2003

Fingerprint

Semisymmetric Graph
Graph in graph theory
Choose
Family

Keywords

  • Graph automorphism group
  • Graphs
  • Product
  • Semisymmetric
  • Symmetry

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

A worthy family of semisymmetric graphs. / Wilson, Stephen E.

In: Discrete Mathematics, Vol. 271, No. 1-3, 28.09.2003, p. 283-294.

Research output: Contribution to journalArticle

@article{4a09919443ce4461a6436b3e1ae23b0c,
title = "A worthy family of semisymmetric graphs",
abstract = "In this paper, we construct semisymmetric graphs in which no two vertices have exactly the same neighbors. We show how to do this by first considering bi-transitive graphs, and then we show how to choose two such graphs so that their product is regular. We display a family of bi-transitive graphs D N(a,b) which can be used for this purpose and we show that their products are semisymmetric by applying vectors due to Ivanov.",
keywords = "Graph automorphism group, Graphs, Product, Semisymmetric, Symmetry",
author = "Wilson, {Stephen E}",
year = "2003",
month = "9",
day = "28",
doi = "10.1016/S0012-365X(03)00048-7",
language = "English (US)",
volume = "271",
pages = "283--294",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - A worthy family of semisymmetric graphs

AU - Wilson, Stephen E

PY - 2003/9/28

Y1 - 2003/9/28

N2 - In this paper, we construct semisymmetric graphs in which no two vertices have exactly the same neighbors. We show how to do this by first considering bi-transitive graphs, and then we show how to choose two such graphs so that their product is regular. We display a family of bi-transitive graphs D N(a,b) which can be used for this purpose and we show that their products are semisymmetric by applying vectors due to Ivanov.

AB - In this paper, we construct semisymmetric graphs in which no two vertices have exactly the same neighbors. We show how to do this by first considering bi-transitive graphs, and then we show how to choose two such graphs so that their product is regular. We display a family of bi-transitive graphs D N(a,b) which can be used for this purpose and we show that their products are semisymmetric by applying vectors due to Ivanov.

KW - Graph automorphism group

KW - Graphs

KW - Product

KW - Semisymmetric

KW - Symmetry

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

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

U2 - 10.1016/S0012-365X(03)00048-7

DO - 10.1016/S0012-365X(03)00048-7

M3 - Article

VL - 271

SP - 283

EP - 294

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -