Split 2-Equitable Domination in Fuzzy Graphs
##plugins.themes.bootstrap3.article.sidebar##
Download : 17 times
##plugins.themes.bootstrap3.article.main##
T. Rabeeh Ahamed
S. Ismail Mohideen
R. Jahir Hussain
S. Muthupandiyan
R. Sathiyapriya
Abstract
A sub set ????⊆????(????)of a fuzzy graph????(????,????)is said to be equitable dominating set if each ????∈????−????, there exists a vertex ????∈????such that ????????∈????(????)and |deg????(????)−deg????(????)|≤1. An equitable dominating set ????of ????(????)is said to be 2-equitable dominating set in a fuzzy graphs ????(????,????), if every vertex ????∈????−????there exists a vertex ????∈????or ????is equitable dominated by at least two vertices in ????.A 2-equitable dominating set ????⊆????(????)of a fuzzy graph ????(????,????)is said to be split2-equitable dominating set if the induced subgraph 〈????−????〉is disconnected. In this study, split2-equitable equitable dominating set, its number in fuzzy graphs are introduced. Bounds and some theorems related to split2-equitable equitable domination numbers are stated and proved.
##plugins.themes.bootstrap3.article.details##

This work is licensed under a Creative Commons Attribution 4.0 International License.