cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

1, 1, 9, 45, 566, 6294, 125160, 2384157, 71563278
Offset: 1

Views

Author

Jason Kimberley, May 17 2010

Keywords

Comments

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

Crossrefs

Row sums of triangle A177741.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.