|
%I #10 Jul 28 2017 13:26:04
%S 1,1,0,2,4,0,7,10,0,30,56,0,0,316,0,1096
%N Number of nonisomorphic self-complementary circulant graphs (Cayley graphs for the cyclic group) of order 4n+1.
%C Further values for (twice) squarefree and (twice) prime-squared orders can be found in the Liskovets reference.
%H V. A. Liskovets, <a href="https://arxiv.org/abs/math/0104131">Some identities for enumerators of circulant graphs</a>, arXiv:math/0104131 [math.CO], 2001.
%H V. A. Liskovets and R. Poeschel, <a href="http://www.math.tu-dresden.de/~poeschel/poePUBLICATIONSps/lispoepp.ps">On the enumeration of circulant graphs of prime-power and squarefree orders</a>
%H R. Poeschel, <a href="http://www.math.tu-dresden.de/~poeschel/Publikationen.html">Publications</a>
%Y Cf. A049297, A049287, A049288.
%K nonn,more,nice
%O 0,4
%A _Valery A. Liskovets_
|
