|
%I M2269 #20 Jun 14 2017 14:14:42
%S 3,3,3,3,4,4,5,5,5,5,5,5,5,6,6,6,7,7,7,7,7,7,7,7,7,7,8,8,8,8,9,9,9,9,
%T 9,9,9,9,9,9,9,9,9,10,10,10,10,10,11,11,11,11,11,11,11,11,11,11,11,11,
%U 11,11,11,11,12,12,12,12,12,12,13,13
%N Edge-distinguishing chromatic number of cycle with n nodes.
%C The minimum number of colors which can be assigned to the vertices of the cycle such that each edge e=uv in the cycle is assigned a different "color" {c(u),c(v)}. - _Sean A. Irvine_, Jun 14 2017
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H K. Al-Wahabi, R. Bari, F. Harary and D. Ullman, <a href="https://doi.org/10.1016/S0167-5060(08)70446-1">The edge-distinguishing chromatic number of paths and cycles</a>, pp. 17-22 of Graph Theory in Memory of G. A. Dirac (Sandbjerg, 1985). Edited by L. D. Andersen et al., Annals of Discrete Mathematics, 41. North-Holland Publishing Co., Amsterdam-New York, 1989.
%F If either r is odd, and r^2 - 2*r + 1 < 2*n <= r^2 + r, or r is even, and r^2 - r < 2 * n <= r^2, then a(n) = r [From Al-Wahabi, et al.].
%K nonn
%O 3,1
%A _N. J. A. Sloane_.
%E More terms and title improved by _Sean A. Irvine_, Jun 14 2017
|
