TY - JOUR AU - Selvakumar, K. AU - Nithya, S. PY - 2011 TI - \(d_2\)-coloring of a Graph JO - Journal of Mathematics and Computer Science SP - 102--111 VL - 3 IS - 2 AB - A subset S of V is called an i-set (\(i\geq 2\)) if no two vertices in S have the distance i. The 2-set number \(\alpha_2(G)\) of a graph is the maximum cardinality among all 2-sets of G. A \(d_2\)-coloring of a graph is an assign- ment of colors to its vertices so that no two vertices have the distance two get the same color. The \(d_2\)-chromatic number \(\chi_{d_2}(G)\) of a graph G is the minimum number of \(d_2\)-colors need to G. In this paper, we initiate a study of these two new parameters. SN - ISSN 2008-949X UR - http://dx.doi.org/10.22436/jmcs.03.02.01 DO - 10.22436/jmcs.03.02.01 ID - Selvakumar2011 ER -