On r- Dynamic coloring of the gear graph families
DOI:
https://doi.org/10.22199/issn.0717-6279-2021-01-0001Keywords:
r− dynamic coloring, Gear graph, Middle graph, Central graph and line graphAbstract
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). 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 r−dynamic chromatic number of the middle, central and line graphs of the gear graph.
References
A. Ahadi, S. Akbari, A. Dehghan, and M. Ghanbari, “On the difference between chromatic number and dynamic chromatic number of graphs”, Discrete ,mathematics, vol. 312, no. 17, pp. 2579–2583, Sep. 2012, doi: 10.1016/j.disc.2011.09.006
S. Akbari, M. Ghanbari, and S. Jahanbakam, “On the dynamic chromatic number of graphs,” in Combinatorics and Graphs, vol. 531, R. A. Brualdi, S. Hedayat, H. Kharaghani, G. H. Khosrovshahi, and S. Shahriari, Eds. Providence, RI: American Mathematical Society, 2010, pp. 11–18, doi: 10.1090/conm/531/10454
S. Akbari, M. Ghanbari, and S. Jahanbekam, “On the list dynamic coloring of graphs”, Discrete applied mathematics, vol. 157, no. 14, pp. 3005–3007, Jul. 2009, doi: 10.1016/j.dam.2009.05.002
M. Alishahi, “Dynamic chromatic number of regular graphs”, Discrete applied mathematics, vol. 160, no. 15, pp. 2098–2103, Oct. 2012, doi: 10.1016/j.dam.2012.05.017
J. A. Bondy and U. S. R. Murty, Graph theory. New York, NY: Springer, 2008.
D. Michalak, “On middle and total graphs with coarseness number equal 1”, in Graph theory , vol. 1018, M. Borowiecki , J. W. Kennedy, and M. M. Sysło, Eds. Berlin: Springer, 1983, pp. 139-150, doi: 10.1007/BFb0071624
A. Dehghan and A. Ahadi, “Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number”, Discrete applied mathematics, vol. 160, no. 15, pp. 2142–2146, Oct. 2012. doi: 10.1016/j.dam.2012.05.003
H. J. Lai, B. Montgomery, and H. Poon, “Upper bounds of dynamic chromatic number”, Ars combinatoria, vol. 68, pp. 193-201, Jul. 2003. [On line]. Available: https://bit.ly/2VccDet
X. Li and W. Zhou, “The 2nd-order conditional 3-coloring of claw-free graphs”, Theoretical computer sciences, vol. 396, no. 1-3, pp. 151-157, May. 2008, doi: 10.1016/j.tcs.2008.01.034
X. Li, X. Yao, W. Zhou, and H. Broersma, “Complexity of conditional colorability of graphs”, Applied mathematical letters, vol. 22, no. 3, pp. 320-324, Mar. 2009, doi: 10.1016/j.aml.2008.04.003
N. Mohanapriya, J. Vernold Vivin and M. Venkatachalam, “δ- dynamic chromatic number of Helm graph families”, Cogent mathematics, vol. 3, Art. ID. 1178411, May 2016, doi: 10.1080/23311835.2016.1178411
N. Mohanapriya, J. Vernold Vivin, and M. Venkatachalam, “On dynamic coloring of Fan graphs”, International journal of pure applied matematics, vol. 106, no. 8, pp. 169-174, 2016. [On line]. Available: https://bit.ly/2VkTsPw
N. Mohanapriya, "A study on dynamic coloring of graphs", Ph. D. Thesis, Bharathiar University, Coimbatore, India, 2017.
B. Montgomery, “Dynamic coloring of graphs”, Ph. D. Thesis, West Virginia University, 2001, doi: 10.33915/etd.1397
A. Taherkhani, “On r-Dynamic chromatic number of graphs”, Discrete applied mathematics, vol. 201, pp. 222-227, Mar. 2016, doi: 10.1016/j.dam.2015.07.019
J. Vernold Vivin, “Harmonious coloring of total graphs, n−leaf, central graphs and circumdetic graphs”, Ph. D. Thesis, Bharathiar University, Coimbatore, India, 2007.
A. T. White, Graphs, groups and surfaces. Amsterdam: North-Holland, 1973.
Published
How to Cite
Issue
Section
Copyright (c) 2021 T. Deepa, M. Venkatachalam, D. Dafik
This work is licensed under a Creative Commons Attribution 4.0 International License.
-
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.
