A Study on Achromatic Coloring Graphs and its Applications
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 133 | Views: 360

Research Paper | Mathematics | India | Volume 2 Issue 1, January 2013 | Popularity: 6.2 / 10


     

A Study on Achromatic Coloring Graphs and its Applications

V.Kavitha, R.Govindarajan


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


Edition: Volume 2 Issue 1, January 2013


Pages: 105 - 108



Please Disable the Pop-Up Blocker of Web Browser

Verification Code will appear in 2 Seconds ... Wait



Text copied to Clipboard!
V.Kavitha, R.Govindarajan, "A Study on Achromatic Coloring Graphs and its Applications", International Journal of Science and Research (IJSR), Volume 2 Issue 1, January 2013, pp. 105-108, https://www.ijsr.net/getabstract.php?paperid=IJSR13010142, DOI: https://www.doi.org/10.21275/IJSR13010142

Top