On r- dynamic coloring of the family of bistar graphs

Simple item page
dc.contributor.authorNANDİNİ, G.
dc.contributor.authorVENKATACHALAM, M.
dc.contributor.authorGOWRİ, S.
dc.contributor.departmentOthertr_TR
dc.contributor.facultyOthertr_TR
dc.date.accessioned2021-11-03T06:35:13Z
dc.date.available2021-11-03T06:35:13Z
dc.date.issued2019-02-01
dc.description.abstractAn 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 middle, total, central and line graph of Bistar graph.tr_TR
dc.description.indexTrdizintr_TR
dc.identifier.endpage928tr_TR
dc.identifier.issn/e-issn2618-6470
dc.identifier.issue1tr_TR
dc.identifier.startpage923tr_TR
dc.identifier.urihttps://doi.org/10.31801/cfsuasmas.489727tr_TR
dc.identifier.urihttp://hdl.handle.net/20.500.12575/75850
dc.identifier.volume68tr_TR
dc.language.isoentr_TR
dc.publisherAnkara Üniversitesi Fen Fakültesitr_TR
dc.relation.isversionof10.31801/cfsuasmas.489727tr_TR
dc.relation.journalCommunications Faculty of Sciences University of Ankara Series A1 Mathematics and Statisticstr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıtr_TR
dc.subjectr-dynamic coloringtr_TR
dc.subjectBistar graphtr_TR
dc.subjectMiddle graphtr_TR
dc.titleOn r- dynamic coloring of the family of bistar graphstr_TR
dc.typeArticletr_TR

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
77.pdf
Size:
252.35 KB
Format:
Adobe Portable Document Format
Description:
Dergi
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Cilt:68 Sayı:01 (2019)