In this paper, bondage and non-bondage set of a fuzzy graph are discussed. The bondage number b(G) and non-bondage number b n (G) of a fuzzy graph G are defined. The upper bound for both b(G) and b n (G) are given. Also some results on b(G) and b n (G) are discussed. The exact values of b(G) and b n (G) are determined for several classes of fuzzy graphs.
More general form of the notion of quasi-coincidence of a fuzzy point with a fuzzy subset is considered, and generalization of fuzzy fated of R0-algebras is discussed. The notion of an (∈, ∈ ∨ q k )-fuzzy fated filter in a R0-algebra is introduced, and several properties are investigated. Characterizations of an (∈, ∈ ∨ q k )-fuzzy fated filter in an R0-algebra are discussed. Using a collection of fated filters, a (∈, ∈ ∨ q k )-fuzzy fated filter is established.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.