Abstract
In the recent paper, authors introduced a graph topological structure, called open subset intersection graph of a topological space ϒ(τ) on a finite set X. In this present paper, we continue the study of the graph ϒ(τ) on a finite set X. It is shown that, if τ is a discrete topology on X and |X| ≥ 3, then the graph ϒ(τ) is not bipartite and regular. If τ is a discrete topology on X with |X| = 3 then it is shown that the ϒ(τ) is an edge-transitive graph, Perfect graph, Eulerian and Hamiltonian graph . Moreover, we detremine exact value of the independence number, vertex connectivity and edge connectivity of the graph ϒ(τ).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
