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)|
|Number of pages||12|
|State||Published - Sep 28 2003|
- Graph automorphism group
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics