|
%I #4 Mar 30 2012 16:52:02
%S 1,1,2,3,4,5,7,9,12,15,18,21,25,29,33,37,42,47,52,57,63,69,76,83,90,
%T 97,106,115
%N a(n) = maximal k for which the complete graph on n nodes allows an edge-surjective vertex-k-labeling.
%D S. Brandt et al., Edge-injective and edge-surjective vertex labelings, SIAM J. Discrete Math., 24 (2010), 666-683.
%K nonn
%O 2,3
%A _N. J. A. Sloane_, May 06 2011
|
