Elsevier

Discrete Mathematics

Volume 271, Issues 1–3, 28 September 2003, Pages 283-294
Discrete Mathematics

A worthy family of semisymmetric graphs

https://doi.org/10.1016/S0012-365X(03)00048-7Get rights and content
Under an Elsevier user license
open archive

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 DN(a,b) which can be used for this purpose and we show that their products are semisymmetric by applying vectors due to Ivanov.

Keywords

Graphs
Symmetry
Semisymmetric
Product
Graph automorphism group

Cited by (0)