The Coloring Graph of Complete Graphs

  • Haylee Aileen Harris California State University, Fresno
Keywords: coloring graph; transitive graphs; complete graphs


We study the coloring graph of the family of complete graphs and we prove that Cn(Kt) is regular, transitive, and connected when n>t. Also, we study whether Cn(Kt) is distance transitive or strongly regular, and find its diameter.

How to Cite
Harris, H. A. (2019). The Coloring Graph of Complete Graphs. The PUMP Journal of Undergraduate Research, 2, 150-160. Retrieved from