A Note on St-Coloring of Some Non Perfect Graphs

R. Moran, Aditya Pegu, I. J. Gogoi, A. Bharali
{"title":"A Note on St-Coloring of Some Non Perfect Graphs","authors":"R. Moran, Aditya Pegu, I. J. Gogoi, A. Bharali","doi":"10.9734/BPI/TPMCS/V11/1498A","DOIUrl":null,"url":null,"abstract":"For a graph G = (V,E) and a finite set T of positive integers containing zero, ST-coloring of a graph G is a coloring of the vertices with non negative integers such that for any two vertices of an edge, the absolute differences between the colors of the vertices does not belong to a fixed set T of non negative integers containing zero and for any two distinct edges their absolute differences between the colors of their vertices are distinct. The minimum number of colors needed for an efficient Strong T coloring of a graph is known as ST-Chromatic number. This communication is concerned with the ST-coloring of some non perfect graphs viz. Petersen graph, Double Wheel graph, Helm graph, Flower graph, Sun Flower graph. We compute ST-chromatic number of these non perfect graphs.","PeriodicalId":143004,"journal":{"name":"Theory and Practice of Mathematics and Computer Science Vol. 11","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory and Practice of Mathematics and Computer Science Vol. 11","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9734/BPI/TPMCS/V11/1498A","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

For a graph G = (V,E) and a finite set T of positive integers containing zero, ST-coloring of a graph G is a coloring of the vertices with non negative integers such that for any two vertices of an edge, the absolute differences between the colors of the vertices does not belong to a fixed set T of non negative integers containing zero and for any two distinct edges their absolute differences between the colors of their vertices are distinct. The minimum number of colors needed for an efficient Strong T coloring of a graph is known as ST-Chromatic number. This communication is concerned with the ST-coloring of some non perfect graphs viz. Petersen graph, Double Wheel graph, Helm graph, Flower graph, Sun Flower graph. We compute ST-chromatic number of these non perfect graphs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一些非完美图的st -着色问题的注记
对于图G = (V,E)和一个包含0的正整数有限集合T,图G的st染色是一种非负整数顶点的染色,使得对于一条边的任意两个顶点,顶点颜色的绝对差值不属于包含0的非负整数的固定集合T,并且对于任意两条不同的边,顶点颜色的绝对差值是不同的。对图进行有效的强T着色所需的最小颜色数称为st -色数。本文讨论了Petersen图、Double Wheel图、Helm图、Flower图、Sun Flower图等非完美图的st染色问题。我们计算了这些非完美图的st色数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Note on St-Coloring of Some Non Perfect Graphs Investigation on the Comparisons of Feature Locations Explain the Difficulty in Discriminating Mirror-Reflected Pairs of Geometrical Figures from Disoriented Identical Pairs Classical Algebra: Matrix Multiplication (The Rule of Vacancies)
×
引用
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