Downloads: 144
Research Paper | Mathematics | Volume 2 Issue 1, January 2013 | Pages: 105 - 108 | India
A Study on Achromatic Coloring Graphs and its Applications
Abstract: The achromatic number a (G) of a graph is the greatest number of color in a vertex coloring such that each pair of colors appears on at least one edge. In this paper we give some properties of achromatic coloring for complete graphs and its applications.
Keywords: Achromatic coloring, achromatic number, Lower bound, Upper bound
How to Cite?: V.Kavitha, R.Govindarajan, "A Study on Achromatic Coloring Graphs and its Applications", Volume 2 Issue 1, January 2013, International Journal of Science and Research (IJSR), Pages: 105-108, https://www.ijsr.net/getabstract.php?paperid=IJSR13010142, DOI: https://dx.doi.org/10.21275/IJSR13010142