SFS and SFS-2 Domination
Abstract views: 55 / PDF downloads: 45
Keywords:
Secure Fuzzy soft domination, Secure Fuzzy soft domination number, total secure fuzzy soft domination, fuzzy soft 2-dominating set, total fuzzy soft 2-dominating set, secure fuzzy soft 2-dominating set, total secure fuzzy soft 2-dominating setAbstract
Let $G_{A,V}$ be a fuzzy soft graph and $S\subseteq V$ is a fuzzy soft dominating set in $G_{A,V}$, then $S$ is said to be a secure fuzzy soft dominating set if for each vertex $x_i\in V-S$ is adjacent to a vertex $x_j\in S$ such that $\left(S-\left\{x_j\right\}\right)\cup \left\{x_i\right\}$ is a dominating set for all $e\in A$ and the minimum fuzzy soft cardinality taken over all minimal secure fuzzy soft dominating set is called secure fuzzy soft domination number and is denoted by $\gamma_{sefs}(G_{A,V})$.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.