![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that , for each
, 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
.
AMS Subject Classifications:
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.
1. Introduction
Throughout this paper all graphs are finite and simple. The r-dynamic chromatic number was first introduced by Montgomery (Citation2001). An r-dynamic coloring of a graph G is a map c from V(G) to a set of colors such that (i)if , then
, and (ii) for each vertex
, 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
, 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 (Citation2012), Akbari, Ghanbari, andJahanbakam (Citation2009,Citation2010), Alishahi (Citation2012), Lai, Montgomery, and Poon (Citation2003). There are many upper bounds and lower bounds for
in terms of graph parameters. For example,
for a graph G with , Lai et al. (Citation2003) proved that
. An upper bound for the dynamic chromatic number of a d-regular graph G in terms of
and the independence number of G,
, was introduced in Dehghan and Ahadi (Citation2012). In fact, it was proved that
. Taherkhani gave in (Citation2016) an upper bound for
in terms of the chromatic number, the maximum degree
and the minimum degree
, i.e.
.
Li, Yao, Zhou, and Broersma proved in (Citation2009) that the computational complexity of for a 3-regular graph is an NP-complete problem. Furthermore, Liu and Zhou (Citation2008) 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 when r is
, the minimum degree of the graph. We find the
-dynamic chromatic number for middle, total, and central graph of helm graph.
2. Results
Let G be a graph with vertex set V(G) and edge set E(G). The middle graph (Michalak, Citation1981) of G, denoted by M(G) is defined as follows. The vertex set of M(G) is . Two vertices x, y of M(G) are adjacent in M(G) in case one of the following holds: (i) x, y are in E(G) and x, y are adjacent in G. (ii) x is in V(G), y is in E(G), and x, y are incident in G.
Let G be a graph with vertex set V(G) and edge set E(G). The total graph (Michalak, Citation1981) of G, denoted by T(G) is defined in the following way. The vertex set of T(G) is . Two vertices x, y of T(G) are adjacent in T(G) in case one of the following holds: (i) x, y are in V(G) and x is adjacent to y in G. (ii) x, y are in E(G) and x, y are adjacent in G. (iii) x is in V(G), y is in E(G) and x, y are incident in G.
The central graph (Vernold Vivin, Citation2007) 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 is the graph obtained from an n-wheel graph by adjoining a pendent edge at each node of the cycle. Where
and
where
is the edge
,
is the edge
and
is the edge
. This notation is valid through the entire paper.
Theorem 2.1
Let The
-dynamic chromatic number of the middle graph of a helm of order
is
.
Proof
By the definition of middle graph, . The vertices v and
induce a clique of order
in
. Thus,
Consider the following n-coloring of :
For , assign the color
to
and assign the color
to v. For
, assign the color
to
,
. For
, assign to
one of the allowed colors—such color exists, because
. For
, if any, assign to vertex
one of the allowed colors—such color exists, because
. For
, if any, assign to vertex
one of the allowed colors—such color exists, because
. An easy check shows that N(v) contains an induced clique of order 5, for every
. Thus, this coloring is a
-dynamic coloring. Hence,
Therefore,
,
.
Theorem 2.2
Let . The
-dynamic chromatic number of the total graph of a helm of order
is
.
Proof
By the definition of total graph . The vertices v and
induce a clique of order
in
. Thus,
Consider the following n-coloring of :
For , assign the color
to
and assign the color
to v. For
, assign to
one of the allowed colors—such color exists, because
. For
, assign to
one of the allowed colors—such color exists, because
. For
, if any, assign to vertex
one of the allowed colors—such color exists, because
. For
, if any, assign to vertex
one of the allowed colors—such color exists, because
. An easy check shows that N(v) contains an induced clique of order 5, for every
. Thus, this coloring is a
-dynamic coloring. Hence,
Therefore,
,
.
Theorem 2.3
Let The
-dynamic chromatic number of the central graph of a helm of order
is
.
Proof
By the definition of central graph, subdividing each edge of exactly once and then joining each pair of vertices of
which were non-adjacent. Let
. Clearly, the graph induced by
is a complete graph. Thus, a proper coloring assigns at least
colors to them. The same happens with the subgraph induced by
. Moreover, if we are considering a
-dynamic coloring when
is odd
should have a different color from
,
, because
and
are the only neighbors of
, and
is adjacent to
,
. 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
should be different to the colors assigned to the vertices of
. Since, the vertices
and v induces a clique of order
in
and the vertices
adjacent to
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
and
is impossible. Thus,
.
Consider the following -coloring of
:
For , assign the color
to
and assign the color
to v. For
, assign the color
to
. For
, assign to vertices
,
and
one of the allowed colors—such color exists, because
. An easy check shows that this coloring is a
-dynamic coloring. Hence,
. Therefore,
.
Acknowledgements
With due Respect, the authors sincerely thank the referee for his careful reading, excellent comments and fruitful suggestions that have resulted in the improvement of the quality of this manuscript.
Additional information
Funding
Notes on contributors
N. Mohanapriya
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
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.
M. Venkatachalam
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.
References
- Ahadi, A., Akbari, S., Dehghana, A., & Ghanbari, M. (2012). On the difference between chromatic number and dynamic chromatic number of graphs. Discrete Mathematics, 312, 2579–2583.
- Akbari, S., Ghanbari, M., & Jahanbekam, S. (2009). On the list dynamic coloring of graphs. Discrete Applied Mathematics, 157, 3005–3007.
- Akbari, S., Ghanbari, M., & Jahanbekam, S. (2010). On the dynamic chromatic number of graphs. Combinatorics and Graphs, in: Contemporary Mathematics - American Mathematical Society, 531, 11–18.
- Alishahi, M. (2012). Dynamic chromatic number of regular graphs. Discrete Applied Mathematics, 160, 2098–2103.
- Dehghan, A., & Ahadi, A. (2012). Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. Discrete Applied Mathematics, 160, 2142–2146.
- Lai, H. J., Montgomery, B., & Poon, H. (2003). Upper bounds of dynamic chromatic number. Ars Combinatoria, 68, 193–201.
- Li, X., Yao, X., Zhou, W., & Broersma, H. (2009). Complexity of conditional colorability of graphs. Applied Mathematics Letters, 22, 320–324.
- Li, X., & Zhou, W. (2008). The 2nd-order conditional 3-coloring of claw-free graphs. Theoretical Computer Science, 396, 151–157.
- Michalak, D. (1981). On middle and total graphs with coarseness number equal 1, Springer Verlag graph theory. In Lagow proceedings (pp. 139–150). New York: Springer Verlag Berlin Heidelberg.
- Montgomery, B. (2001). Dynamic coloring of graphs (PhD thesis). West Virginia University. Ann Arbor, MI: ProQuest LLC.
- Taherkhani, A. (2016). On r-dynamic chromatic number of graphs. Discrete Applied Mathematics, 201, 222–227 .
- Vernold Vivin, J. (2007). Harmonious coloring of total graphs, n-leaf, central graphs and circumdetic graphs ( PhD thesis). Coimbatore: Bharathiar University.