Downloads: 133
Research Paper | Mathematics | India | Volume 2 Issue 1, January 2013
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
Similar Articles with Keyword 'Upper bound'
Downloads: 2 | Weekly Hits: ⮙2 | Monthly Hits: ⮙2
Study Papers, Mathematics, India, Volume 12 Issue 12, December 2023
Pages: 1255 - 1259Comprehensive Exploration of the Archimedean Property: Insights and Proofs for Undergraduate Mathematics Students
Downloads: 100
Research Paper, Mathematics, India, Volume 5 Issue 4, April 2016
Pages: 2029 - 2034Second Hankel Determinant for Multivalent Spirallike and Convex Functions of Order Alpha
M. Elumalai | C. Selvaraj [3]