Enumeration of 2-regular circulant graphs and directed double networks Original Research Article

We present a formula to enumerate non-isomorphic circulant digraphs of order image with connection sets of cardinality 2. This formula simplifies to image in the case when image, and image when image(where image is an odd prime and image). The number of non-isomorphic directed double networks are also enumerated.