r-dynamic chromatic number of some line graphs

Hanna Furmańczyk , J. Vernold Vivin , N. Mohanapriya

Abstract

An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min{r,deg(v)}, for each v∈V(G). The r-dynamic chromatic number of a graph G is the smallest k such that G admits an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of the line graph of helm graphs Hn for all r between minimum and maximum degree of Hn. Moreover, our proofs are constructive, what means that we give also polynomial time algorithms for the appropriate coloring. Finally, as the first, we define an equivalent model for edge coloring.
Author Hanna Furmańczyk (FMPI / II)
Hanna Furmańczyk,,
- Institute of Informatics
, J. Vernold Vivin
J. Vernold Vivin,,
-
, N. Mohanapriya
N. Mohanapriya,,
-
Journal seriesIndian Journal of Pure & Applied Mathematics, ISSN 0019-5588, (A 15 pkt)
Issue year2018
Vol49
No4
Pages591-600
Publication size in sheets0.5
Keywords in Englishr-dynamic coloring, conditional coloring, line graph, helm graph
DOIDOI:10.1007/s13226-018-0288-1
URL https://www.insa.nic.in/writereaddata/UpLoadedFiles/IJPAM/Vol49_2018_4_ART02.pdf
Languageen angielski
Score (nominal)15
ScoreMinisterial score = 15.0, 03-12-2018, ArticleFromJournal
Ministerial score (2013-2016) = 15.0, 03-12-2018, ArticleFromJournal
Publication indicators WoS Impact Factor: 2016 = 0.325 (2) - 2016=0.297 (5)
Citation count*
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back