The Coloring Graph of Complete Graphs

  • Haylee Aileen Harris California State University, Fresno
DOI: https://doi.org/10.46787/pump.v2i0.1448
Keywords: coloring graph; transitive graphs; complete graphs

Abstract

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.

Published
2019-09-06
How to Cite
Harris, H. A. (2019). The Coloring Graph of Complete Graphs. The PUMP Journal of Undergraduate Research, 2, 150-160. https://doi.org/10.46787/pump.v2i0.1448
Issue
Vol. 2 (2019): PUMP Journal of Undergraduate Research
Section
Articles

Copyright (c) 2019 Haylee Aileen Harris

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

The author(s) will retain the copyright, but by submitting the article agree to grant permission to the PUMP Journal of Undergraduate Research to publish, distribute, and archive the article. The author(s) will acknowledge prior publication in the PUMP Journal of Undergraduate Research for all future uses of the article or parts of it.