Contents

-

Non-isomorphic Minimal Colorings of K4n+3

V Vijayalakshmi1
1Department of Mathematics, University of Bombay, Vidyanagari, Bombay – 400098, India.

Abstract

We prove that the number of nonisomorphic minimal 2-colorings of the edges of K4n+3 is at least 2n less than the number of nonisomorphic minimal 2-colorings of the edges of K4n+2, where n is a nonnegative integer. Harary explicitly gave all the nonisomorphic minimal 2-colorings of the edges of K6. In this paper, we give all the nonisomorphic minimal 2-colorings of the edges of K7.