OFFSET
2,2
COMMENTS
(n,k)-graphs are simple graphs with n vertices and k edges.
Row indexed n has length 2n-3.
The diagonal counting the super edge-magic labelings of (n,n)-graphs appears to be A077613(n-1).
LINKS
Jason Kimberley, Rows n = 2..101 of triangle
R. M. Figueroa-Centeno et al., The place of super edge-magic labelings among other classes of labelings, Discrete Math., 231 (2001), 153-168.
EXAMPLE
1; 3,2,1; 6,6,6,4,2; 10,14,20,24,24,16,8; ...
PROG
CROSSREFS
KEYWORD
nonn,tabf,easy
AUTHOR
N. J. A. Sloane, Apr 06 2001
EXTENSIONS
Entry T(3,3)=1 (that was erroneously missing from the table of Figueroa-Centeno et al. making the rows appear to be irregular) inserted by, DOI reference provided by, and empirical cross reference for the T(n,n) diagonal observed by Jason Kimberley, Apr 16 2010
STATUS
approved