Abstract
Vague graphs (VGs), which are a family of fuzzy graphs (FGs), are a well-organized and useful tool for capturing and resolving a range of real-world scenarios involving ambiguous data. In graph theory, a dominating set (DS) for a graph G ∗ = X , E is a subset S of the vertices X such that every vertex not in S is adjacent to at least one member of S . The concept of DS in FGs has received the attention of many researchers due to its many applications in various fields such as computer science and electronic networks. In this paper, we introduce the notion of ϵ 1 , ϵ 2 , 2 -Regular vague dominating set and provide some examples to explain various concepts introduced. Also, some results were discussed. Additionally, the ϵ 1 , ϵ 2 , 2 -Regular strong (weak) and independent strong (weak) domination sets for vague domination set (VDS) were presented with some theorems to support the context.
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.
