The Split and Non Split Majority Domonation in Fuzzy Graphs |
||||
|
||||
|
||||
BibTeX: |
||||
@article{IJIRSTV3I12010, |
||||
Abstract: |
||||
A majority dominating set D of a fuzzy graph G is a split majority dominating set if the induced fuzzy sub graph is disconnected. A majority dominating set D of a fuzzy graph G is a non- split majority dominating set if induced fuzzy sub graph is connected. In this paper we study split and non-split majority domination in fuzzy graphs and its domination numbers .Also bounds with other known parameters are discussed. |
||||
Keywords: |
||||
Dominating set, Majority dominating set, split majority dominating set, non-split majority dominating set |
||||