δ-Dynamic chromatic number of Helm graph families

An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min { r,d(v) } , for each v ∈ V(G), where N(v) and d(v) denote the neighborhood and the degree of v, respectively. The r-dynamic chromatic number of a graph G is the minimum k such that G has an r-dynamic coloring with k colors. In this paper, we obtain the -dynamic chromatic number of middle, total, and central of helm graph, where = min


Introduction
Throughout this paper all graphs are finite and simple. The r-dynamic chromatic number was first introduced by Montgomery (2001). An r-dynamic coloring of a graph G is a map c from V(G) to a set of colors such that (i) if uv ∈ E(G), then c(u) ≠ c(v), and (ii) for each vertex ABOUT THE AUTHORS N. Mohanapriya is working as an assistant professor in the Department of Mathematics, RVS Technical Campus-Coimbatore, Tamil Nadu, India. She is pursuing her Part-time (Category B) PhD in Bharathiar University, Coimbatore in the field of graph theory, particularly in graph colorings. She has published five research papers in International and National Journals and Conferences.
J. Vernold Vivin is working as an assistant professor in the Department of Mathematics, University College of Engineering Nagercoil, (Anna University, Constituent College), Konam, Nagercoil. His research areas of interests are graph theory and fractional differential equations. He has published more than 50 research papers in International and National Journals and Conferences.
M. Venkatachalam is working as an assistant professor in the Department of Mathematics, RVS Technical Campus-Coimbatore, Tamil Nadu, India. His research areas of interests are graph theory and inventory models. He has published more than 20 research papers in International and National Journals and Conferences.

PUBLIC INTEREST STATEMENT
Graph coloring is one of the research areas that shaped the graph theory as we know it today; the attempts to prove many more theorems in graph colorings have inspired many notions that became important on their own. Also motivated the study of colorings of various families of graphs, including the graphs embedded in the surfaces of bounded genus. Even though a computer-assisted proof of the theorems was eventually found, many natural problems motivated by it remain unsolved and the study of colorings of planar graphs and of graphs on surfaces is one of the most active areas of research in modern graph theory. This research paper outlines some of recently developed coloring, i.e. dynamic coloring. The new results in this paper are demonstrated by giving detailed proof based on our recent papers and to the best of our knowledge.
v ∈ V(G), |c(N(v))| ≥ min r, d (v) , where N(v) denotes the set of vertices adjacent to v and d(v) is its degree. The r-dynamic chromatic number of a graph G, written r (G), is the minimum k such that G has an r-dynamic proper k-coloring. The 1-dynamic chromatic number of a graph G is equal to its chromatic number. The 2-dynamic chromatic number of a graph has been studied under the name dynamic chromatic number in Ahadi, Akbari, Dehghana, and Ghanbari (2012), Akbari, Ghanbari, and-Jahanbakam (2009, 2010, Alishahi (2012), Lai, Montgomery, and Poon (2003). There are many upper bounds and lower bounds for d (G) in terms of graph parameters. For example, For a graph G with Δ(G) ≥ 3, Lai et al. (2003) proved that d (G) ≤ Δ(G) + 1. An upper bound for the dynamic chromatic number of a d-regular graph G in terms of (G) and the independence number of G, (G), was introduced in Dehghan and . In fact, it was proved that Taherkhani gave in (2016) an upper bound for 2 (G) in terms of the chromatic number, the maximum degree Δ and the minimum degree Li, Yao, Zhou, and Broersma proved in (2009) that the computational complexity of d (G) for a 3-regular graph is an NP-complete problem. Furthermore, Liu and Zhou (2008) showed that to determine whether there exists a 3-dynamic coloring, for a claw free graph with maximum degree 3, is NP-complete.
In this paper, we study r (G) when r is , the minimum degree of the graph. We find the -dynamic chromatic number for middle, total, and central graph of helm graph.

Results
Let G be a graph with vertex set V(G) and edge set E(G). The middle graph (Michalak, 1981)  Let G be a graph with vertex set V(G) and edge set E(G). The total graph (Michalak, 1981) The central graph (Vernold Vivin, 2007) C(G) of a graph G is obtained from G by subdividing each edge of G exactly once and then joining each pair of vertices of the original graph which were previously non-adjacent.
The helm graph H n is the graph obtained from an n-wheel graph by adjoining a pendent edge at each node of the cycle.
. This notation is valid through the entire paper.
Theorem 2.1 Let n ≥ 8. The -dynamic chromatic number of the middle graph of a helm of order 2n − 1 is (M(H n )) = n.
Proof By the definition of middle graph, The vertices v and {e i :1 ≤ i ≤ n − 1} induce a clique of order K n in M(H n ). Thus, (M(H n )) ≥ n.

Consider the following n-coloring of M H n :
For 1 ≤ i ≤ n − 1, assign the color c i to e i and assign the color c n to v. For 1 ≤ i ≤ n − 1, assign the color c n to u i , deg(u i ) = (M(H n )) = 1. For 1 ≤ i ≤ n − 1, assign to e ′ i one of the allowed colors-such color exists, because deg(u i ) = 8. For 1 ≤ i ≤ n − 1, if any, assign to vertex v i one of the allowed colors-such color exists, because deg(v i ) = 4. For 1 ≤ i ≤ n − 1, if any, assign to vertex s i one of the allowed colors-such color exists, because deg(s i ) = 3. An easy check shows that N(v) contains an induced clique of order 5, for every v ∈ V M H n . Thus, this coloring is a -dynamic coloring. Hence, (M(H n )) ≤ n. Therefore, (M(H n )) = n, ∀ n ≥ 8. ✷ Theorem 2.2 Let n ≥ 9. The -dynamic chromatic number of the total graph of a helm of order 2n − 1 is (T(H n )) = n.
Proof By the definition of total graph The vertices v and {e i :1 ≤ i ≤ n − 1} induce a clique of order K n in T(H n ). Thus, (T(H n )) ≥ n.

Consider the following n-coloring of T H n :
For 1 ≤ i ≤ n − 1, assign the color c i to e i and assign the color c n to v. For 1 ≤ i ≤ n − 1, assign to u i one of the allowed colors-such color exists, because (u i ) = deg(u i ) = 2. For 1 ≤ i ≤ n − 1, assign to e ′ i one of the allowed colors-such color exists, because deg(u i ) = 8. For 1 ≤ i ≤ n − 1, if any, assign to vertex v i one of the allowed colors-such color exists, because deg(v i ) = 8. For 1 ≤ i ≤ n − 1, if any, assign to vertex s i one of the allowed colors-such color exists, because deg(s i ) = 5. An easy check shows that N(v) contains an induced clique of order 5, for every v ∈ V M H n . Thus, this coloring is a -dynamic coloring. Hence, (T(H n )) ≤ n. Therefore, (T(H n )) = n, ∀ n ≥ 9.
Clearly, the graph induced by {v 2i : i = 1, 2, … , ⌊(n − 1)∕2⌋} is a complete graph. Thus, a proper coloring assigns at least ⌊(n − 1)∕2⌋ colors to them. The same happens with the subgraph induced by {v 2i−1 : i = 1, 2, … , ⌊(n − 1)∕2⌋}. Moreover, if we are considering a -dynamic coloring when n − 1 is odd v n−1 should have a different color from v 2i−1 , i = 1, 2, … , (n − 1)∕2, because v n−1 and v 1 are the only neighbors of e � n−1 , and v n−1 is adjacent to v 2i−1 , i = 2, … , (n − 1)∕2. A similar reasoning also shows that in a -dynamic coloring, the colors assigned to odd vertices should be different to the colors assigned to even vertices and that all of them should be different from the color assigned to v. It is also shown that in a -dynamic coloring, the colors assigned to vertices {v} ∪ {v i :1 ≤ i ≤ n − 1} should be different to the colors assigned to the vertices of {u i :1 ≤ i ≤ n − 1}. Since, the vertices {u i :1 ≤ i ≤ n − 1} and v induces a clique of order K n in C(H n ) and the vertices {v i :1 ≤ i ≤ n − 1} adjacent to {u j :1 ≤ j ≤ n − 1} ∀ i ≠ j. But, any three consecutive vertices of the path must be colored differently in any dynamic coloring. Since, the first and third vertices are the only neighbors of the second vertex and must be colored differently (by the condition of dynamic coloring) and also differently from the second vertex. So, the same color to {v i :1 ≤ i ≤ n − 1} and {u j :1 ≤ j ≤ n − 1} ∀ i = j is impossible. Thus, (C(H n )) ≥ 2n − 1.
Consider the following 2n − 1-coloring of C H n : For 1 ≤ i ≤ n − 1, assign the color c i to v i and assign the color c n to v. For 1 ≤ i ≤ n − 1, assign the color c n+i to u i . For 1 ≤ i ≤ n − 1, assign to vertices s i , e ′ i and e i one of the allowed colors-such color exists, because deg(s i ) = deg(e � i ) = deg(e i ) = (C(H n )) = 2. An easy check shows that this coloring is a -dynamic coloring. Hence, (C(H n )) ≤ 2n − 1. Therefore, (C(H n )) = 2n − 1. ✷ You are free to: Share -copy and redistribute the material in any medium or format Adapt -remix, transform, and build upon the material for any purpose, even commercially. The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms: Attribution -You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.

No additional restrictions
You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.