login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of integral circulant graphs with perfect state transfer on 4*n vertices.
0

%I #4 Jun 21 2012 03:25:05

%S 2,2,4,4,4,16,4,8,8,16,4,256,4,16,16,16,4,512,4,256,16,16,4,4096,8,16,

%T 16,256,4,65536,4,32,16,16,16,262144,4,16,16,4096,4,65536,4,256,64,16,

%U 4,65536,8,512,16,256,4,65536,16,4096,16,16,4,4294967296

%N Number of integral circulant graphs with perfect state transfer on 4*n vertices.

%H Fomin, Sergey; Zelevinsky, Andrei; <a href="http://arxiv.org/abs/math/0104241">The Laurent phenomenon</a>, arXiv:math/0104241v1 [math.CO] (2001), Advances in Applied Mathematics 28 (2002), 119-144.

%e For n=1 there are a(1)=2 graphs with perfect state transfer: C_4 and the disjoint union of two copies of K_2.

%K nonn

%O 1,1

%A _Matthew C. Russell_, Apr 25 2012