|
%I #12 Nov 07 2023 11:18:11
%S 1,3,6,11,15,21,32,46,64,86,110
%N The smallest value of the largest label for which there exists an edge-magic injection of the complete graph K_n on n vertices.
%D W. D. Wallis. Magic Graphs. Birkhäuser, (2001). Section 2.10.
%H A. Kotzig and A. Rosa, <a href="http://dx.doi.org/10.4153/CMB-1970-084-1">Magic Valuations of Finite Graphs</a>, Canad. Math. Bull. v.13 (1970), pp. 451-461.
%H J. P. McSorley and J. A. Trono, <a href="https://doi.org/10.1016/j.disc.2009.07.021">On k-minimum and m-minimum Edge-Magic Injections of Graphs</a>, Discrete Mathematics, Volume 310, Issue 1, 6 January 2010, Pages 56-69.
%e a(4)=11 because when forming an edge-magic injection of K_4 we must use at least the first 10 natural numbers {1,2,...10} since K_4 has a total of 10 vertices and edges. However this is not possible. But there is an edge-magic injection using the set {1,2,....11}\{4}, namely with {1,2,3,5} as the vertex labels.
%Y See related sequence A129413 which concerns the smallest value of the magic sum of an edge-magic injection of K_n.
%K nonn,more
%O 1,2
%A _John P. McSorley_, Dec 10 2008
|
