On r− dynamic coloring of the gear graph families
Abstract 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 t...
Guardado en:
| Autores principales: | , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000100001 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:scielo:S0716-09172021000100001 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720210001000012021-01-26On r− dynamic coloring of the gear graph familiesDeepa,T.Venkatachalam,M.Dafik, r− dynamic coloring gear graph middle graph central graph and line graph Abstract 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.40 n.1 20212021-02-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000100001en10.22199/issn.0717-6279-2021-01-0001 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
English |
| topic |
r− dynamic coloring gear graph middle graph central graph and line graph |
| spellingShingle |
r− dynamic coloring gear graph middle graph central graph and line graph Deepa,T. Venkatachalam,M. Dafik, On r− dynamic coloring of the gear graph families |
| description |
Abstract 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. |
| author |
Deepa,T. Venkatachalam,M. Dafik, |
| author_facet |
Deepa,T. Venkatachalam,M. Dafik, |
| author_sort |
Deepa,T. |
| title |
On r− dynamic coloring of the gear graph families |
| title_short |
On r− dynamic coloring of the gear graph families |
| title_full |
On r− dynamic coloring of the gear graph families |
| title_fullStr |
On r− dynamic coloring of the gear graph families |
| title_full_unstemmed |
On r− dynamic coloring of the gear graph families |
| title_sort |
on r− dynamic coloring of the gear graph families |
| publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
| publishDate |
2021 |
| url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000100001 |
| work_keys_str_mv |
AT deepat onr8722dynamiccoloringofthegeargraphfamilies AT venkatachalamm onr8722dynamiccoloringofthegeargraphfamilies AT dafik onr8722dynamiccoloringofthegeargraphfamilies |
| _version_ |
1718439889886773248 |