International Journal of Mathematics Trends and Technology
Volume 33 | Number 1 | Year 2016 | Article Id. IJMTT-V33P504 | DOI : https://doi.org/10.14445/22315373/IJMTT-V33P504
A coloring of a graph G is called a complementary coloring of G if whenever two vertices u and v have distinct colors then u and v are adjacent. An n – coloring which is also complementary is called complementary n – coloring. Complementary chromatic number of a graph G is the largest integer k such that G admits a complementary k – coloring. This number is denoted as (G). Complementary coloring the vertices of G using maximum possible number of colors divides the vertex set V of G into disjoint subsets in such a way that vertices that are in distinct subsets are adjacent. Collection of these subsets is called - Partition of a graph G. In this paper we prove that any graph G admits unique – Partition.
[1] Douglas B. West (Second Edition), „„Introduction to Graph Theory‟‟, Pearsen Education, INC.., 2005.
[2] D. K. Thakkar and A.B.Kothiya, “Complementary Coloring of Graphs”, PRAJNA – Journal of Pure and Applied Sciences, Vol. 20, 2012, 79 – 80.
[3] D.K.Thakkar and A.B.Kothiya, “ Total Dominating Color Transversal number of Graphs”, Annals of Pure and Applied Mathematics, Vol. 11 (2), 2016, 39 – 44.
[4] D.K.Thakkar and A.B.Kothiya, “Dominating and Total Dominating Complementary Color Transversal number of Graphs”, Submitted for publication in Annals of pure and Applied Mathematics.
[5] D. S. T. Ramesh, S. Athisayanathan, A. Anto Kinsley, J. Vinolin "Line Join Connected Domination on a Graph", International Journal of Mathematics Trends and Technology (IJMTT). V32(2), April 2016, 66-70.
D.K. Thakkar, A.B. Kothiya, "Uniqueness of Xc- Partition of a graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 33, no. 1, pp. 16-18, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V33P504
PDF 
Abstract 
Keywords 
References 
Citation