Solving the dynamic coloring problem for direct products of paths with fan graphs

This paper deals with the r-dynamic chromatic problem of the direct product of a path with a fan graph Fm,n. The problem is completely solved except for the case n < r ∈ {2m + 2, 2m + 3}, which is solved under certain assumptions. It enables us to determine in particular the dynamic chromatic num...

Full description

Bibliographic Details
Authors: Falcón Ganfornina, Raúl Manuel, Gowri, Sathasivam, Venkatachalam, Mathiyazhagan
Format: article
Status:Published version
Publication Date:2023
Country:España
Institution:Universidad de Sevilla (US)
Repository:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/155652
Online Access:https://hdl.handle.net/11441/155652
https://doi.org/10.2478/auom-2023-0006
Access Level:Open access
Keyword:Dynamic coloring problem
Direct product
Path
Fan graph
id ES_ca4fdf02e39861fa061aa903d7e347f9
oai_identifier_str oai:idus.us.es:11441/155652
network_acronym_str ES
network_name_str España
repository_id_str
spelling Solving the dynamic coloring problem for direct products of paths with fan graphsFalcón Ganfornina, Raúl ManuelGowri, SathasivamVenkatachalam, MathiyazhaganDynamic coloring problemDirect productPathFan graphThis paper deals with the r-dynamic chromatic problem of the direct product of a path with a fan graph Fm,n. The problem is completely solved except for the case n < r ∈ {2m + 2, 2m + 3}, which is solved under certain assumptions. It enables us to determine in particular the dynamic chromatic number concerning this problem, for all r ≤ 7, and also, for all m ∈ {1, 2}.SciendoMatemática Aplicada IFQM016: Códigos, Diseños, Criptografía y OptimizaciónJunta de Andalucía2023info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/155652https://doi.org/10.2478/auom-2023-0006reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésAnalele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică, 31 (1), 115-142.FQM-016https://sciendo.com/article/10.2478/auom-2023-0006info:eu-repo/semantics/openAccessoai:idus.us.es:11441/1556522026-06-17T12:51:07Z
dc.title.none.fl_str_mv Solving the dynamic coloring problem for direct products of paths with fan graphs
title Solving the dynamic coloring problem for direct products of paths with fan graphs
spellingShingle Solving the dynamic coloring problem for direct products of paths with fan graphs
Falcón Ganfornina, Raúl Manuel
Dynamic coloring problem
Direct product
Path
Fan graph
title_short Solving the dynamic coloring problem for direct products of paths with fan graphs
title_full Solving the dynamic coloring problem for direct products of paths with fan graphs
title_fullStr Solving the dynamic coloring problem for direct products of paths with fan graphs
title_full_unstemmed Solving the dynamic coloring problem for direct products of paths with fan graphs
title_sort Solving the dynamic coloring problem for direct products of paths with fan graphs
dc.creator.none.fl_str_mv Falcón Ganfornina, Raúl Manuel
Gowri, Sathasivam
Venkatachalam, Mathiyazhagan
author Falcón Ganfornina, Raúl Manuel
author_facet Falcón Ganfornina, Raúl Manuel
Gowri, Sathasivam
Venkatachalam, Mathiyazhagan
author_role author
author2 Gowri, Sathasivam
Venkatachalam, Mathiyazhagan
author2_role author
author
dc.contributor.none.fl_str_mv Matemática Aplicada I
FQM016: Códigos, Diseños, Criptografía y Optimización
Junta de Andalucía
dc.subject.none.fl_str_mv Dynamic coloring problem
Direct product
Path
Fan graph
topic Dynamic coloring problem
Direct product
Path
Fan graph
description This paper deals with the r-dynamic chromatic problem of the direct product of a path with a fan graph Fm,n. The problem is completely solved except for the case n < r ∈ {2m + 2, 2m + 3}, which is solved under certain assumptions. It enables us to determine in particular the dynamic chromatic number concerning this problem, for all r ≤ 7, and also, for all m ∈ {1, 2}.
publishDate 2023
dc.date.none.fl_str_mv 2023
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/155652
https://doi.org/10.2478/auom-2023-0006
url https://hdl.handle.net/11441/155652
https://doi.org/10.2478/auom-2023-0006
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică, 31 (1), 115-142.
FQM-016
https://sciendo.com/article/10.2478/auom-2023-0006
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Sciendo
publisher.none.fl_str_mv Sciendo
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869419468865667072
score 15,811543

Similar Items