A worthy family of semisymmetric graphs

Steve Wilson

Research output: Contribution to journalArticlepeer-review

22 Scopus citations


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
Issue number1-3
StatePublished - Sep 28 2003


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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'A worthy family of semisymmetric graphs'. Together they form a unique fingerprint.

Cite this