无线电1 -制服色数????—循环分割图和????-车轮星图

Jenish Revaldo C, Anthuvan Joseph B, Jesto Peter, Aravind K
{"title":"无线电1 -制服色数????—循环分割图和????-车轮星图","authors":"Jenish Revaldo C, Anthuvan Joseph B, Jesto Peter, Aravind K","doi":"10.15680/ijirset.2022.1102089","DOIUrl":null,"url":null,"abstract":"For any integer ????, lies between zero and diameter plus one, a radio ???? −chromatic labelling of a simple connected graph ???? = (????, ????) is a mapping from ????(????) to N such that ????(????, ????) + |????(????) − ????(????)| ≥ 1 + ???? , ∀ ????, ???? ∈ ????(????), where ????(????, ????) is the distance between ???? and ????. The maximum number assigned to a vertex under the mapping ℎ is denoted by ????????????(????), is called the radio ???? - chromatic number of G under the mapping ????. The radio ????- chromatic number of G, denoted by ????????????(????) is the minimum value taken over all such radio ???? - chromatic numbers of ????. In this paper, we have obtained the radio 1-chromatic number of Uniform r - cyclic split graph and ????-wheel star graph.","PeriodicalId":14005,"journal":{"name":"International Journal of Innovative Research in Science, Engineering and Technology","volume":"11 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Radio 1 - Chromatic Number of Uniform ???? - Cyclic Split Graph and ????-Wheel Star Graph\",\"authors\":\"Jenish Revaldo C, Anthuvan Joseph B, Jesto Peter, Aravind K\",\"doi\":\"10.15680/ijirset.2022.1102089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For any integer ????, lies between zero and diameter plus one, a radio ???? −chromatic labelling of a simple connected graph ???? = (????, ????) is a mapping from ????(????) to N such that ????(????, ????) + |????(????) − ????(????)| ≥ 1 + ???? , ∀ ????, ???? ∈ ????(????), where ????(????, ????) is the distance between ???? and ????. The maximum number assigned to a vertex under the mapping ℎ is denoted by ????????????(????), is called the radio ???? - chromatic number of G under the mapping ????. The radio ????- chromatic number of G, denoted by ????????????(????) is the minimum value taken over all such radio ???? - chromatic numbers of ????. In this paper, we have obtained the radio 1-chromatic number of Uniform r - cyclic split graph and ????-wheel star graph.\",\"PeriodicalId\":14005,\"journal\":{\"name\":\"International Journal of Innovative Research in Science, Engineering and Technology\",\"volume\":\"11 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Innovative Research in Science, Engineering and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15680/ijirset.2022.1102089\",\"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 Journal of Innovative Research in Science, Engineering and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15680/ijirset.2022.1102089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

对于任意整数????,位于0和直径+ 1之间,一个无线电????−单连通图的彩色标记????= (? ?, ? ?)是一个映射 ????(????) 到N,这样 ????(????, ????) + |????(????)−????(????)|≥1 + ????,∀????, ? ?∈????(????),其中????(????(????)是????之间的距离和? ?。在映射下分配给顶点的最大数目用????????????(????)表示,称为无线电????-映射下G的色数????。收音机????- G的色数,用????????????(????)表示,是所有此类无线电的最小值????- ????的色数。本文得到了均匀r循环分裂图的无线电1色数和????-车轮星图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Radio 1 - Chromatic Number of Uniform ???? - Cyclic Split Graph and ????-Wheel Star Graph
For any integer ????, lies between zero and diameter plus one, a radio ???? −chromatic labelling of a simple connected graph ???? = (????, ????) is a mapping from ????(????) to N such that ????(????, ????) + |????(????) − ????(????)| ≥ 1 + ???? , ∀ ????, ???? ∈ ????(????), where ????(????, ????) is the distance between ???? and ????. The maximum number assigned to a vertex under the mapping ℎ is denoted by ????????????(????), is called the radio ???? - chromatic number of G under the mapping ????. The radio ????- chromatic number of G, denoted by ????????????(????) is the minimum value taken over all such radio ???? - chromatic numbers of ????. In this paper, we have obtained the radio 1-chromatic number of Uniform r - cyclic split graph and ????-wheel star graph.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信