Add to ORKGAbstract. In this paper we introduce the concept of strong total domination in fuzzy graphs. We determine the strong total domination number for several classes of fuzzy graphs. A lower bound and an upper bound for the strong total domination number in terms of strong domination number is obtained. Strong total domination in fuzzy trees is studied. A necessary and sufficient condition for the set of fuzzy cut nodes to be a strong total dominating set is discussed. Also it is established that in a non trivial fuzzy tree each node of a strong total dominating set is incident on a fuzzy bridge
Abstract. In this paper strong adjacency matrix of a fuzzy graph is discussed. Some properties of th...
We introduce a new variation on the domination theme which we call vertex domination as reducing was...
The basic definitions of fuzzy independent set, fuzzy dominating set,and fuzzy independent dominatin...
AbstractIn this paper, the concept of strong domination number is introduced by using membership val...
In this paper, the concept of strong domination number is introduced by using membership values of s...
Abstract. In this paper, we introduce the concept of strong and weak domination in fuzzy graphs, and...
We do fuzzification the concept of domination in crisp graph by using membership values of nodes, α-...
We do fuzzification the concept of domination in crisp graph by using membership values of nodes, α-...
In this paper, domination integrity of fuzzy graph and efficient fuzzy graph concepts is introduced ...
Let G be a fuzzy graph. Then D Ôèå V is said to be a strong (weak) fuzzy dominating set of G if ever...
A set D ⊂ V of a given fuzzy graph ܩ(ܸ,ߩ, ߤ) is a dominating set if for every ݑ ∈ ܸ − ܦ there...
For the first time, We do fuzzification the concept of domination in crisp graph on a generalization...
In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominat...
Abstract. Given two fuzzy graphs ()1 1 1,G σ µ = and ()2 2 2,G σ µ = we consider some parameters of ...
Abstract. In this paper we introduce the concepts of domination and total domination in product fuzz...
Abstract. In this paper strong adjacency matrix of a fuzzy graph is discussed. Some properties of th...
We introduce a new variation on the domination theme which we call vertex domination as reducing was...
The basic definitions of fuzzy independent set, fuzzy dominating set,and fuzzy independent dominatin...
AbstractIn this paper, the concept of strong domination number is introduced by using membership val...
In this paper, the concept of strong domination number is introduced by using membership values of s...
Abstract. In this paper, we introduce the concept of strong and weak domination in fuzzy graphs, and...
We do fuzzification the concept of domination in crisp graph by using membership values of nodes, α-...
We do fuzzification the concept of domination in crisp graph by using membership values of nodes, α-...
In this paper, domination integrity of fuzzy graph and efficient fuzzy graph concepts is introduced ...
Let G be a fuzzy graph. Then D Ôèå V is said to be a strong (weak) fuzzy dominating set of G if ever...
A set D ⊂ V of a given fuzzy graph ܩ(ܸ,ߩ, ߤ) is a dominating set if for every ݑ ∈ ܸ − ܦ there...
For the first time, We do fuzzification the concept of domination in crisp graph on a generalization...
In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominat...
Abstract. Given two fuzzy graphs ()1 1 1,G σ µ = and ()2 2 2,G σ µ = we consider some parameters of ...
Abstract. In this paper we introduce the concepts of domination and total domination in product fuzz...
Abstract. In this paper strong adjacency matrix of a fuzzy graph is discussed. Some properties of th...
We introduce a new variation on the domination theme which we call vertex domination as reducing was...
The basic definitions of fuzzy independent set, fuzzy dominating set,and fuzzy independent dominatin...