Abstract
Let £ be a C-lattice. Let σ(£) be the set of all prime elements of £ and M(£) be the collection of all maximal elements of £. For S ⊆M(£), we introduce the new graph called S-join graph on σ(£), denoted by ΓS(σ(£)). We have studied properties like connectivity, diameter and domination number of the graph σ(£) . In this paper, we established that the topological space σ(£) is connected if and only if the graph ΓS(σ(£)) is connected.
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.
