Article contents
Counting 2-circulant graphs
Published online by Cambridge University Press: 09 April 2009
Abstract
Alspach and Sutcliffe call a graph X(S, q, F) 2-circulant if it consists of two isomorphic copies of circulant graphs X(p, S) and X(p, qS) on p vertices with “cross-edges” joining one another in a prescribed manner. In this paper, we enumerate the nonisomorphic classes of 2-circulant graphs X(S, q, F) such that |S| = m and |F| = k. We also determine a necessary and sufficient condition for a 2-circulant graph to be a GRR. The nonisomorphic classes of GRR on 2p vertices are also enumerated.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1985
References
- 1
- Cited by