On the isomorphism problem for a family of cubic metacirculant graphs

Abstract In this paper an isomorphism testing algorithm for graphs in the family of all cubic metacirculant graphs with non-empty first symbol S 0 is given. The time complexity of this algorithm is also evaluated.

[1]  Counting 2-circulant graphs , 1985 .

[2]  J. Graver,et al.  The groups of the generalized Petersen graphs , 1971, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Brian Alspach,et al.  A Construction for Vertex-Transitive Graphs , 1982, Canadian Journal of Mathematics.

[4]  Brian Alspach,et al.  Hamilton Cycles in Metacirculant Graphs with Prime Cardinality Blocks , 1985 .

[5]  Brian Alspach,et al.  VERTEX‐TRANSITIVE GRAPHS OF ORDER 2p , 1979 .