|
%I #8 Mar 19 2018 04:08:12
%S 1,1,9,45,566,6294,125160,2384157,71563278
%N The number of strong vertex magic total labelings of all 2-regular simple graphs on 2n+1 vertices.
%C A simple counting argument shows that no 2-regular graph of even order possesses a strong VMTL.
%C In 2-regular graphs we can swap the interpretation of edges and vertices; so this sequence also gives the number of super edge magic total labelings; hence c.f. the (n,n) diagonal of A060408.
%Y Row sums of triangle A177741.
%K hard,more,nonn
%O 1,3
%A _Jason Kimberley_, May 17 2010
|
