Loading…
A Study on Regular Domination in Vague Graphs with Application
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 no...
Saved in:
Published in: | Advances in mathematical physics 2023-05, Vol.2023, p.1-9 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 1687-9120 1687-9139 |
DOI: | 10.1155/2023/7098134 |