小直径路径幂的无线电 k 着色线性算法

IF 1.1 3区计算机科学 Q1 BUSINESS, FINANCE

Journal of Computer and System Sciences Pub Date : 2024-08-26 DOI:10.1016/j.jcss.2024.103577

Dipayan Chakraborty , Soumen Nandi , Sagnik Sen , D.K. Supraja

{"title":"小直径路径幂的无线电 k 着色线性算法","authors":"Dipayan Chakraborty , Soumen Nandi , Sagnik Sen , D.K. Supraja","doi":"10.1016/j.jcss.2024.103577","DOIUrl":null,"url":null,"abstract":"<div>The radio k-chromatic number <math><mi>r</mi><msub><mrow><mi>c</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> of a graph G is the minimum integer λ such that there exists a function <math><mi>ϕ</mi><mo>:</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>→</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>⋯</mo><mo>,</mo><mi>λ</mi><mo>}</mo></math> satisfying <math><mo>|</mo><mi>ϕ</mi><mo>(</mo><mi>u</mi><mo>)</mo><mo>−</mo><mi>ϕ</mi><mo>(</mo><mi>v</mi><mo>)</mo><mo>|</mo><mo>≥</mo><mi>k</mi><mo>+</mo><mn>1</mn><mo>−</mo><mi>d</mi><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></math>, where <math><mi>d</mi><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></math> denotes the distance between u and v. A considerable amount of attention has been given to find the exact values or providing polynomial time algorithms to determine <math><mi>r</mi><msub><mrow><mi>c</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> for several basic graph families such as paths, cycles, trees, and powers of paths, usually for some specific values of k. In this article, we find the exact values of <math><mi>r</mi><msub><mrow><mi>c</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> where G is a power of a path with diameter strictly less than k. Our proof readily provides a linear time algorithm for assigning a radio k-coloring of G. Furthermore, our proof technique is a potential tool for solving the same problem for other classes of graphs having “small” diameters.</div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"147 ","pages":"Article 103577"},"PeriodicalIF":1.1000,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A linear algorithm for radio k-coloring of powers of paths having small diameters\",\"authors\":\"Dipayan Chakraborty , Soumen Nandi , Sagnik Sen , D.K. Supraja\",\"doi\":\"10.1016/j.jcss.2024.103577\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>The radio k-chromatic number <math><mi>r</mi><msub><mrow><mi>c</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> of a graph G is the minimum integer λ such that there exists a function <math><mi>ϕ</mi><mo>:</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>→</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>⋯</mo><mo>,</mo><mi>λ</mi><mo>}</mo></math> satisfying <math><mo>|</mo><mi>ϕ</mi><mo>(</mo><mi>u</mi><mo>)</mo><mo>−</mo><mi>ϕ</mi><mo>(</mo><mi>v</mi><mo>)</mo><mo>|</mo><mo>≥</mo><mi>k</mi><mo>+</mo><mn>1</mn><mo>−</mo><mi>d</mi><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></math>, where <math><mi>d</mi><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></math> denotes the distance between u and v. A considerable amount of attention has been given to find the exact values or providing polynomial time algorithms to determine <math><mi>r</mi><msub><mrow><mi>c</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> for several basic graph families such as paths, cycles, trees, and powers of paths, usually for some specific values of k. In this article, we find the exact values of <math><mi>r</mi><msub><mrow><mi>c</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> where G is a power of a path with diameter strictly less than k. Our proof readily provides a linear time algorithm for assigning a radio k-coloring of G. Furthermore, our proof technique is a potential tool for solving the same problem for other classes of graphs having “small” diameters.</div>\",\"PeriodicalId\":50224,\"journal\":{\"name\":\"Journal of Computer and System Sciences\",\"volume\":\"147 \",\"pages\":\"Article 103577\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2024-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer and System Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0022000024000722\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BUSINESS, FINANCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000024000722","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}

引用次数: 0

摘要

图 G 的无线电 k 色度数 rck(G) 是存在函数 ϕ:V(G)→{0,1,⋯,λ} 满足 |ϕ(u)-ϕ(v)|≥k+1-d(u,v) 的最小整数 λ，其中 d(u,v) 表示 u 和 v 之间的距离。对于一些基本图族，如路径、循环、树和路径的幂，通常是针对某些特定的 k 值，人们已经花费了大量精力去寻找它们的精确值或提供多项式时间算法来确定 rck(G)。在本文中，我们找到了 rck(G)的精确值，其中 G 是直径严格小于 k 的路径的幂。我们的证明很容易提供一种线性时间算法，用于为 G 指定无线电 k 着色。

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

查看原文本刊更多论文

A linear algorithm for radio k-coloring of powers of paths having small diameters

The radio k-chromatic number $r c_{k} (G)$ of a graph G is the minimum integer λ such that there exists a function $ϕ : V (G) \to {0, 1, \dots, λ}$ satisfying $| ϕ (u) - ϕ (v) | \geq k + 1 - d (u, v)$ , where $d (u, v)$ denotes the distance between u and v. A considerable amount of attention has been given to find the exact values or providing polynomial time algorithms to determine $r c_{k} (G)$ for several basic graph families such as paths, cycles, trees, and powers of paths, usually for some specific values of k. In this article, we find the exact values of $r c_{k} (G)$ where G is a power of a path with diameter strictly less than k. Our proof readily provides a linear time algorithm for assigning a radio k-coloring of G. Furthermore, our proof technique is a potential tool for solving the same problem for other classes of graphs having “small” diameters.

求助全文

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

来源期刊

Journal of Computer and System Sciences 工程技术-计算机：理论方法

CiteScore

3.70

自引率

0.00%

发文量

审稿时长

68 days

期刊介绍： The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.