几类图的连接的填充色数

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
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A refinement of Lang's formula for the sums of powers of integers A method for evaluating definite integrals in terms of special functions with examples Strong version of Andrica's conjecture Root configurations of real univariate cubics and quartics Generalization of Rodrigues' formula in Weyl space
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1