Topological structures induced by chromatic partitioning of vertex set of graphs

IF 0.4 Q4 MATHEMATICS
K. Lalithambigai, P. Gnanachandra
{"title":"Topological structures induced by chromatic partitioning of vertex set of graphs","authors":"K. Lalithambigai, P. Gnanachandra","doi":"10.7546/nntdm.2023.29.3.620-634","DOIUrl":null,"url":null,"abstract":"This paper presents a method of constructing topologies on vertex set of a graph G induced by chromatic partition of vertex set of the graph. It introduces colour lower approximation and colour upper approximation of vertex induced subgraphs and acquaints the open and closed sets of the topology generated by chromatic partition on the vertex set of graphs. It explores some of the properties of colour lower approximation and colour upper approximation of vertex induced subgraphs. It also establishes some new subgraphs based on the colour lower approximation and colour upper approximation and some of their properties have been studied.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":" ","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Notes on Number Theory and Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7546/nntdm.2023.29.3.620-634","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents a method of constructing topologies on vertex set of a graph G induced by chromatic partition of vertex set of the graph. It introduces colour lower approximation and colour upper approximation of vertex induced subgraphs and acquaints the open and closed sets of the topology generated by chromatic partition on the vertex set of graphs. It explores some of the properties of colour lower approximation and colour upper approximation of vertex induced subgraphs. It also establishes some new subgraphs based on the colour lower approximation and colour upper approximation and some of their properties have been studied.
图的顶点集的色划分引起的拓扑结构
本文给出了由图的顶点集的色分划导出的图G的顶点集上的拓扑构造方法。介绍了顶点诱导子图的颜色下近似和颜色上近似,并给出了由图的顶点集上的色划分生成的拓扑的开集和闭集。探讨了顶点诱导子图的颜色下近似和颜色上近似的一些性质。在颜色下近似和颜色上近似的基础上建立了一些新的子图,并研究了它们的一些性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
33.30%
发文量
71
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信