Chromatic Coloring of Distance Graphs I
V. Yegnanarayanan
1V. Yegnanarayanan, Department of Mathematics, Kalasalingam Academy for Research and Education, Deemed to be University, Krishnankoil, Srivilliputhur (Tamil Nadu), India.
Manuscript received on June 20, 2021. | Revised Manuscript received on June 30, 2021. | Manuscript published on July 30, 2021. | PP: 31-34 | Volume-10, Issue-9, July 2021 | Retrieval Number: 100.1/ijitee.I92910710921 | DOI: 10.35940/ijitee.I9291.0710921
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The primary aim of this paper is to publicize various problems regarding chromatic coloring of finite, simple and undirected graphs. A simple motivation for this work is that the coloring of graphs gives models for a variety of real world problems such as scheduling. We prove some interesting results related to the computation of chromatic number of certain distance graphs and also discuss some open problems.
Keywords: Graph coloring, chromatic number, distance graph