Buscar
Mostrando ítems 1-5 de 5
Artículo
The r-dynamic edge coloring of a closed helm graph
(Unión Matemática Argentina, 2023-11-22)
As a natural generalization of the classical coloring problem in graph theory, the dynamic coloring problem deals with the existence of a proper coloring c of a graph so that |c(N(v))| ≥ min{r, d (v)} for every vertex v . ...
Artículo
On the r-dynamic coloring of the direct product of a path with either a path or a cycle
(AIMS Press, 2020)
In this paper, we determine explicitly the r-dynamic chromatic number of the direct product of any given path with either a path or a cycle. Illustrative examples are shown for each one of the cases that are studied ...
Artículo
On the r-dynamic coloring of the direct product of a path with either a complete graph or a wheel graph
(AIMS Press, 2021)
In this paper, it is explicitly determined the r-dynamic chromatic number of the direct product of any given path with either a complete graph or a wheel graph. Illustrative examples are shown for each one of the cases ...
Artículo
On the r-dynamic coloring of some fan graph families
(Ovidius University Constanta, 2021)
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), ...
Artículo
On the r-dynamic coloring of subdivision-edge coronas of a path
(AIMS Press, 2020)
This paper deals with the r-dynamic chromatic number of the subdivision-edge corona of a path and exactly one of the following nine types of graphs: a path, a cycle, a wheel, a complete graph, a complete bipartite graph, ...