几类图的连接的填充色数

International Mathematical Forum Pub Date : 1900-01-01 DOI:10.12988/imf.2022.912315

Alje Marie M. Urenda, Jacel Angeline V. Lingcong, Normina A. Batucan, Joel G. Adanza, Michael P. Baldado Jr.

{"title":"几类图的连接的填充色数","authors":"Alje Marie M. Urenda, Jacel Angeline V. Lingcong, Normina A. Batucan, Joel G. Adanza, Michael P. Baldado Jr.","doi":"10.12988/imf.2022.912315","DOIUrl":null,"url":null,"abstract":"Let G be a graph. A packing k-coloring of G is a function f : V (G)→ {1, 2, . . . , k} such that any two vertices of color i are at a distance at least i + 1. The packing chromatic number of G, denoted by χρ(G), is the smallest integer k for which there exists a packing k-coloring f : V (G)→ {1, 2, . . . , k}. In this paper, we gave the packing chromatic number of the join of some classes of graphs. Moreover, we characterized graphs with packing chromatic number equal to their order. Mathematics Subject Classification: 05C15","PeriodicalId":107214,"journal":{"name":"International Mathematical Forum","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Packing chromatic number of the join of some classes of graphs\",\"authors\":\"Alje Marie M. Urenda, Jacel Angeline V. Lingcong, Normina A. Batucan, Joel G. Adanza, Michael P. Baldado Jr.\",\"doi\":\"10.12988/imf.2022.912315\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a graph. A packing k-coloring of G is a function f : V (G)→ {1, 2, . . . , k} such that any two vertices of color i are at a distance at least i + 1. The packing chromatic number of G, denoted by χρ(G), is the smallest integer k for which there exists a packing k-coloring f : V (G)→ {1, 2, . . . , k}. In this paper, we gave the packing chromatic number of the join of some classes of graphs. Moreover, we characterized graphs with packing chromatic number equal to their order. Mathematics Subject Classification: 05C15\",\"PeriodicalId\":107214,\"journal\":{\"name\":\"International Mathematical Forum\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Mathematical Forum\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12988/imf.2022.912315\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Mathematical Forum","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12988/imf.2022.912315","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

设G是一个图。G的填充k-着色是一个函数f: V (G)→{1,2，…， k}使得任意两个颜色为I的顶点之间的距离至少为I + 1。G的填充色数，用χρ(G)表示，是存在填充k-着色f: V (G)→{1,2，…的最小整数k。k}。本文给出了几类图的连接的填充色数。此外，我们还刻画了图的填充色数等于其阶数。数学学科分类:055c15

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

查看原文本刊更多论文

Packing chromatic number of the join of some classes of graphs

Let G be a graph. A packing k-coloring of G is a function f : V (G)→ {1, 2, . . . , k} such that any two vertices of color i are at a distance at least i + 1. The packing chromatic number of G, denoted by χρ(G), is the smallest integer k for which there exists a packing k-coloring f : V (G)→ {1, 2, . . . , k}. In this paper, we gave the packing chromatic number of the join of some classes of graphs. Moreover, we characterized graphs with packing chromatic number equal to their order. Mathematics Subject Classification: 05C15

求助全文

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

来源期刊

International Mathematical Forum

自引率

0.00%

发文量