Fuzzy sets and logics is a true crowning achievement of the century. Among the variety of exemplary changes in science and technology, the concept of uncertainty played a significant role, which led to the development of fuzzy sets, which in turn helped in the transition from graph theory to fuzzy graph theory. This paper familiarizes an improved concept in fuzzy graphs, called contraction. Two types of contraction namely edge contraction and neighbourhood contraction are introduced. We developed these two concepts in fuzzy graphs and analyse its effect on domination number and edge domination number. Any research is meaningful only by its contribution to the society. The modern world and the field of networks are inseparable. We have appli...
AbstractIn this paper, the concept of strong domination number is introduced by using membership val...
The product vague graph (PVG) is one of the most significant issues in fuzzy graph theory, which has...
A set D ⊂ V of a given fuzzy graph ܩ(ܸ,ߩ, ߤ) is a dominating set if for every ݑ ∈ ܸ − ܦ there...
The aim of this expository article is to present recent developments in the centuries-old discussion...
Fuzzy soft set are presented by creator Molodtsov, which is tackle uncertain issues in the field of ...
In this paper we consider the effect of edge contraction on the domination number and total dominati...
The aim of this expository article is to present recent developments in the centuries-old discussion...
Abstract. In this paper, we introduce the concept of strong and weak domination in fuzzy graphs, and...
Consider a simple connected fuzzy graph (FG) G and consider an ordered fuzzy subset H = {(u1, σ(u1))...
In this article, we establish edge domination in Bipolar Hesitancy Fuzzy Graph(BHFG). Various domina...
In this paper, the total dominating set, edge dominating set and domination number (TDN & EDN) for a...
We introduce a new variation on the domination theme which we call vertex domination as reducing was...
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, α-...
A new domination parameter in a fuzzy digraph is proposed to espouse a contribution in the domain of...
AbstractIn this paper, the concept of strong domination number is introduced by using membership val...
The product vague graph (PVG) is one of the most significant issues in fuzzy graph theory, which has...
A set D ⊂ V of a given fuzzy graph ܩ(ܸ,ߩ, ߤ) is a dominating set if for every ݑ ∈ ܸ − ܦ there...
The aim of this expository article is to present recent developments in the centuries-old discussion...
Fuzzy soft set are presented by creator Molodtsov, which is tackle uncertain issues in the field of ...
In this paper we consider the effect of edge contraction on the domination number and total dominati...
The aim of this expository article is to present recent developments in the centuries-old discussion...
Abstract. In this paper, we introduce the concept of strong and weak domination in fuzzy graphs, and...
Consider a simple connected fuzzy graph (FG) G and consider an ordered fuzzy subset H = {(u1, σ(u1))...
In this article, we establish edge domination in Bipolar Hesitancy Fuzzy Graph(BHFG). Various domina...
In this paper, the total dominating set, edge dominating set and domination number (TDN & EDN) for a...
We introduce a new variation on the domination theme which we call vertex domination as reducing was...
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, α-...
A new domination parameter in a fuzzy digraph is proposed to espouse a contribution in the domain of...
AbstractIn this paper, the concept of strong domination number is introduced by using membership val...
The product vague graph (PVG) is one of the most significant issues in fuzzy graph theory, which has...
A set D ⊂ V of a given fuzzy graph ܩ(ܸ,ߩ, ߤ) is a dominating set if for every ݑ ∈ ܸ − ܦ there...