

A177742


The number of strong vertex magic total labelings of all 2regular simple graphs on 2n+1 vertices.


1




OFFSET

1,3


COMMENTS

A simple counting argument shows that no 2regular graph of even order possesses a strong VMTL.
In 2regular 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.


LINKS



CROSSREFS



KEYWORD

hard,more,nonn


AUTHOR



STATUS

approved



