On the r-dynamic coloring of some fan graph families-Reference-Cited by-同舟云学术

On the r-dynamic coloring of some fan graph families

Published:2021-11-01 Issue:3 Volume:29 Page:151-181
ISSN:1844-0835
Container-title:Analele Universitatii "Ovidius" Constanta - Seria Matematica
language:en
Short-container-title:

Author:

Falcón Raúl M.¹,Venkatachalam M.²,Gowri S.³,Nandini G.³

Affiliation:

1. Department of Applied Mathematics I , Universidad de Sevilla , Avenida Reina Mercedes 4 A, 41012 , Sevilla , Spain .

2. Department of Mathematics , Kongunadu Arts and Science College , Coimbatore - 641 029, Tamil Nadu , India .

3. Department of Mathematics , SNS College of Technology , Coimbatore - 641 035, Tamil Nadu , India .

Abstract

Abstract In this paper, we determine the r-dynamic chromatic number of the fan graph Fm,n and determine sharp bounds of this graph invariant for four related families of graphs: The middle graph M(Fm,n ), the total graph T (Fm,n ), the central graph C(Fm,n ) and the line graph L(Fm,n ). In addition, we determine the r-dynamic chromatic number of each one of these four families of graphs in case of being m = 1.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/auom-2021-0039

Reference33 articles.

1. [1] Ahadi A, Akbari S, Dehghana A, Ghanbari M. On the difference between chromatic number and dynamic chromatic number of graphs. Discrete Mathematics 2012; 312 (17): 2579–2583.10.1016/j.disc.2011.09.006

2. [2] Akbari S, Ghanbari M, Jahanbakam S. On the dynamic chromatic number of graphs. In: Combinatorics and graphs. Contemporary Mathematics 2010; 531: 11–18.10.1090/conm/531/10454

3. [3] Alishahi M. On the dynamic coloring of graphs. Discrete Applied Mathematics 2011; 159 (2-3): 152–156.10.1016/j.dam.2010.10.012

4. [4] Alishahi M. Dynamic chromatic number of regular graphs. Discrete Applied Mathematics 2012; 160 (15): 2098–2103.10.1016/j.dam.2012.05.017

5. [5] Ansari N, Chandel RS, Jamal R. On b-chromatic number of prism graph families. Applications and Applied Mathematics. An International Journal (AAM) 2018; 13 (1): 286–295.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the dynamic coloring problem for direct products of paths with fan graphs;AN STI U OVID CO-MAT;2023

2. Optimal secret share distribution in degree splitting communication networks;Networks and Heterogeneous Media;2023