Some results of inclusion graph of a topology

被引:1
|
作者
Muneshwar, R. A. [1 ]
Bondar, K. L. [2 ]
机构
[1] NES Sci Coll, PG Dept Math, Nanded 431602, Maharashtra, India
[2] Govt Vidarbha Inst Sci & Humanities, PG Dept Math, Amravati 444604, Maharashtra, India
关键词
Topology; Graph; Dimeter; Girth; Clique number; Domination number; Independance number;
D O I
10.1080/09720529.2021.1969752
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we introduce a graph topological structure called Inclusion Graph of a Topology I-N(X) = (V(tau), E(tau)). The diameter, girth, connectivity, maximal independent sets, different variants of domination number and chromatic number I-N(X), edge and vertex connectivity of I-N(X) are studied. Moreover, we derive the upper and lower bonds of clique number and a chromatic number of the graph I-N(X).
引用
收藏
页码:135 / 145
页数:11
相关论文
共 50 条