A worthy family of semisymmetric graphs

Steve Wilson

doi:10.1016/S0012-365X(03)00048-7

A worthy family of semisymmetric graphs

Steve Wilson

Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

24 Scopus citations

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 language	English (US)
Pages (from-to)	283-294
Number of pages	12
Journal	Discrete Mathematics
Volume	271
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(03)00048-7
State	Published - Sep 28 2003

Keywords

Graph automorphism group
Graphs
Product
Semisymmetric
Symmetry

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

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

Cite this

@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 = "Steve Wilson",

year = "2003",

month = sep,

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 B.V.",

number = "1-3",

}

TY - JOUR

T1 - A worthy family of semisymmetric graphs

AU - Wilson, Steve

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 - https://www.scopus.com/pages/publications/0041888240

UR - https://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

AN - SCOPUS:0041888240

SN - 0012-365X

VL - 271

SP - 283

EP - 294

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

A worthy family of semisymmetric graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this