Add to ORKGAbstract. In this paper strong adjacency matrix of a fuzzy graph is discussed. Some properties of the strong adjacency matrix are also given. An algorithm is discussed to find the edge dominating sets of a fuzzy graph. And another algorithm is also discussed to find a maximal edge dominating set of a fuzzy graph. Suitable examples are also given
The aim of this expository article is to present recent developments in the centuries-old discussion...
Let G be an IFG. Then VD is said to be a strong (weak) dominating set if every DVv is strongly (w...
In this paper, domination integrity of fuzzy graph and efficient fuzzy graph concepts is introduced ...
A set D ⊂ V of a given fuzzy graph ܩ(ܸ,ߩ, ߤ) is a dominating set if for every ݑ ∈ ܸ − ܦ there...
In this paper, the concept of strong domination number is introduced by using membership values of s...
AbstractIn this paper, the concept of strong domination number is introduced by using membership val...
Abstract. In this paper we introduce the concept of strong total domination in fuzzy graphs. We dete...
Abstract. In this paper, we introduce the concept of strong and weak domination in fuzzy graphs, and...
Let G be a fuzzy graph. Then D Ôèå V is said to be a strong (weak) fuzzy dominating set of G if ever...
In this paper, the total dominating set, edge dominating set and domination number (TDN & EDN) for a...
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 a new definition of adjacency matrix in the simple graphs is presented that is called ...
We present a taxonomy of fuzzy graphs that treats fuzziness in vertex existence, edge existence, edg...
Abstract. Given two fuzzy graphs ()1 1 1,G σ µ = and ()2 2 2,G σ µ = we consider some parameters of ...
The aim of this expository article is to present recent developments in the centuries-old discussion...
Let G be an IFG. Then VD is said to be a strong (weak) dominating set if every DVv is strongly (w...
In this paper, domination integrity of fuzzy graph and efficient fuzzy graph concepts is introduced ...
A set D ⊂ V of a given fuzzy graph ܩ(ܸ,ߩ, ߤ) is a dominating set if for every ݑ ∈ ܸ − ܦ there...
In this paper, the concept of strong domination number is introduced by using membership values of s...
AbstractIn this paper, the concept of strong domination number is introduced by using membership val...
Abstract. In this paper we introduce the concept of strong total domination in fuzzy graphs. We dete...
Abstract. In this paper, we introduce the concept of strong and weak domination in fuzzy graphs, and...
Let G be a fuzzy graph. Then D Ôèå V is said to be a strong (weak) fuzzy dominating set of G if ever...
In this paper, the total dominating set, edge dominating set and domination number (TDN & EDN) for a...
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 a new definition of adjacency matrix in the simple graphs is presented that is called ...
We present a taxonomy of fuzzy graphs that treats fuzziness in vertex existence, edge existence, edg...
Abstract. Given two fuzzy graphs ()1 1 1,G σ µ = and ()2 2 2,G σ µ = we consider some parameters of ...
The aim of this expository article is to present recent developments in the centuries-old discussion...
Let G be an IFG. Then VD is said to be a strong (weak) dominating set if every DVv is strongly (w...
In this paper, domination integrity of fuzzy graph and efficient fuzzy graph concepts is introduced ...