关于图的（k，ℓ）定位着色

Pub Date : 2024-07-05 DOI:10.2989/16073606.2024.2364301

Michael A. Henning, Mostafa Tavakoli

{"title":"关于图的（k，ℓ）定位着色","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":"{\"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}","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

摘要

让 c：v(g) → {1, ., ℓ} = [ℓ] 是 G 的适当顶点着色，且 C(i) = {u ∈ V(G): c(u) = i} for i ∈ [ℓ].顶点 v 的 k 色码 rk(v|c) 是有序的 ℓ 元组（aG(v,C(1)), ., aG(...

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

On (k, ℓ)-locating colorings of graphs

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(...

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助