Open Access · CC BY-NC 4.0
The Coloring Graph of Complete Graphs
The PUMP Journal of Undergraduate Research · 2019
DOI: 10.46787/pump.v2i0.1448 ↗Kurz gefasst
Fachartikel in der Zeitschrift The PUMP Journal of Undergraduate Research, 2019. Verfasst von Haylee Aileen Harris. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Harris, H. A. (2019). The Coloring Graph of Complete Graphs. The PUMP Journal of Undergraduate Research. https://doi.org/10.46787/pump.v2i0.1448
Vancouver
Harris HA. The Coloring Graph of Complete Graphs. The PUMP Journal of Undergraduate Research. 2019. doi:10.46787/pump.v2i0.1448
BibTeX
@article{Harris2019,
author = {Harris, Haylee Aileen},
title = {The Coloring Graph of Complete Graphs},
journal = {The PUMP Journal of Undergraduate Research},
year = {2019},
doi = {10.46787/pump.v2i0.1448}
}
EUVIMED