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 | |
| State | Published - Sep 28 2003 |
Keywords
- Graph automorphism group
- Graphs
- Product
- Semisymmetric
- Symmetry
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'A worthy family of semisymmetric graphs'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS