{"title":"On (k, ℓ)-locating colorings of graphs","authors":"Michael A. Henning, Mostafa Tavakoli","doi":"10.2989/16073606.2024.2364301","DOIUrl":null,"url":null,"abstract":"Let c: V(G) → {1, . . . , ℓ} = [ℓ] be a proper vertex coloring of G and C(i) = {u ∈ V(G): c(u) = i} for i ∈ [ℓ]. The k-color code rk(v|c) of vertex v is the ordered ℓ-tuple (aG(v,C(1)), . . . , aG(...","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2989/16073606.2024.2364301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Let c: V(G) → {1, . . . , ℓ} = [ℓ] be a proper vertex coloring of G and C(i) = {u ∈ V(G): c(u) = i} for i ∈ [ℓ]. The k-color code rk(v|c) of vertex v is the ordered ℓ-tuple (aG(v,C(1)), . . . , aG(...