SFS and SFS-2 Domination


Abstract views: 54 / PDF downloads: 45

Authors

  • Rani Rajeevan Department of Mathematics, Sree Narayana College, Chathannur, Kollam, Kerala, India
  • T. K. Mathew Varkey Department of Mathematics, T.K.M College of Engineering, Kollam, Kreala, India

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 set

Abstract

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

15-12-2018

How to Cite

Rani Rajeevan, & T. K. Mathew Varkey. (2018). SFS and SFS-2 Domination. International Journal of Mathematics And Its Applications, 6(4), 143–147. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/336

Issue

Section

Research Article