The Coloring Graph of 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.
Copyright (c) 2019 Haylee Aileen Harris
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.