Some results of inclusion graph of a topology

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).