Publication:
On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)

Simple item page
dc.contributor.authorDeepa, T.
dc.contributor.authorVenkatachalam, M.
dc.contributor.buuauthorCangül, İsmail Naci
dc.contributor.buuauthorCANGÜL, İSMAİL NACİ
dc.contributor.orcid0000-0002-5552-2362
dc.contributor.orcid0000-0002-0700-5774
dc.contributor.researcheridJ-3505-2017
dc.date.accessioned2024-09-25T07:45:15Z
dc.date.available2024-09-25T07:45:15Z
dc.date.issued2022-06-01
dc.description.abstractAn r-dynamic coloring of a graph G is a proper coloring c of the vertices such that vertical bar c(N(v))vertical bar >= min{r,d(v)} for each vertex v is an element of 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 brick product graphs.
dc.identifier.doi10.1142/S1793557122501029
dc.identifier.issn1793-5571
dc.identifier.issue06
dc.identifier.scopus2-s2.0-85113217746
dc.identifier.urihttps://doi.org/10.1142/S1793557122501029
dc.identifier.urihttps://hdl.handle.net/11452/45202
dc.identifier.volume15
dc.identifier.wos000810932100007
dc.indexed.wosWOS.ESCI
dc.language.isoen
dc.publisherWorld Scientific Publ Co Pte Ltd
dc.relation.journalAsian-european Journal Of Mathematics
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectR-dynamic coloring
dc.subjectBrick product graph
dc.subjectScience & technology
dc.subjectPhysical sciences
dc.subjectMathematics
dc.titleOn r-dynamic chromatic number of some brick product graphs C(2n, 1, p)
dc.typeArticle
dspace.entity.typePublication
local.indexed.atWOS
local.indexed.atScopus
relation.isAuthorOfPublication601ef81f-9bdf-4a4a-9ac1-82a82260384d
relation.isAuthorOfPublication.latestForDiscovery601ef81f-9bdf-4a4a-9ac1-82a82260384d

Files

Collections

İndeksli Yayınlar / Indexed Publications