scholarly journals Dominating Energy of Operations on Intuitionistic Fuzzy Graphs

2018 ◽  
Vol 7 (4.10) ◽  
pp. 328 ◽  
Author(s):  
A. Kalimulla ◽  
R. Vijayaragavan ◽  
S. Sharief Basha

The concept of energy of an Intuitionistic Fuzzy Graph is extended to dominating Energy in operations on Intuitionistic Fuzzy Graph. In this paper, We have obtained the value of dominating Energy in different operations such as complement, Union, Join, Cartesian product and composition between two intuitionistic Fuzzy graphs. Also we study the relation between the dominating Energy in the operations on two Intuitionistic Fuzzy Graphs.  

2019 ◽  
Vol 8 (3) ◽  
pp. 8536-8545

The observation of an Intuitionistic Fuzzy Graph’s signless laplacian energy is expanded innumerous products in Intuitionistic Fuzzy Graph. During this paper, we have got the value of signless laplacian Energy in unrelated products such as Cartesian product, Lexicographic Product, Tensor product and Strong Product, product, product and product amongst 2 intuitionistic Fuzzy graphs. Additionally we tend to study the relation between the Signless laplacian Energy within the varied products in 2 Intuitionistic Fuzzy Graphs


Author(s):  
S. Yahya Mohamed ◽  
A. Mohamed Ali

AbstractIn this paper, the complement of max product of two intuitionistic fuzzy graphs is defined. The degree of a vertex in the complement of max product of intuitionistic fuzzy graph is studied. Some results on complement of max product of two regular intuitionistic fuzzy graphs are stated and proved. Finally, we provide an application of intuitionistic fuzzy graphs in school determination using normalized Hamming distance.


2018 ◽  
Vol 7 (4.10) ◽  
pp. 892
Author(s):  
Obbu Ramesh ◽  
S. Sharief Basha

We are extending concept into the Intuitionistic fuzzy graph’ Signless Laplacian energy  instead of the Signless Laplacian energy of fuzzy graph. Now we demarcated an Intuitionistic fuzzy graph’s Signless adjacency matrix and also  an Intuitionistic fuzzy graph’s Signless Laplacian energy. Here we find the Signless Laplacian energy ‘s Intuitionistic fuzzy graphs above and below   boundaries of   an with suitable examples.   


A Perfectly regular intuitionistic fuzzy graph is an intuitionistic fuzzy graph that is both regular and totally regular. In this paper we introduce and classify these types of intuitionistic fuzzy graphs and study several of their properties, including how two classes of intuitionistic fuzzy graphs structurally relate to one another and several of their spectral properties such as isospectral intuitionistic fuzzy graphs and when the energy of intuitionistic fuzzy graph is proportional to the energy of their underlying crisp graphs. These properties are studied in particular due to having at least one constant function and .


2021 ◽  
Vol 16 ◽  
pp. 77-82
Author(s):  
Wael Ahmad Alzoubi ◽  
As’ad Mahmoud As’ad Alnaser

In this paper, we introduced some concepts of connectivity in an intuitionistic fuzzy graphs, also we study intuitionistic fuzzy cut vertices and intuitionistic fuzzy bridges in fuzzy graph. Connectivity in complete intuitionistic fuzzy graphs is also studied


Mathematics ◽  
2019 ◽  
Vol 7 (5) ◽  
pp. 470 ◽  
Author(s):  
Cen Zuo ◽  
Anita Pal ◽  
Arindam Dey

The picture fuzzy set is an efficient mathematical model to deal with uncertain real life problems, in which a intuitionistic fuzzy set may fail to reveal satisfactory results. Picture fuzzy set is an extension of the classical fuzzy set and intuitionistic fuzzy set. It can work very efficiently in uncertain scenarios which involve more answers to these type: yes, no, abstain and refusal. In this paper, we introduce the idea of the picture fuzzy graph based on the picture fuzzy relation. Some types of picture fuzzy graph such as a regular picture fuzzy graph, strong picture fuzzy graph, complete picture fuzzy graph, and complement picture fuzzy graph are introduced and some properties are also described. The idea of an isomorphic picture fuzzy graph is also introduced in this paper. We also define six operations such as Cartesian product, composition, join, direct product, lexicographic and strong product on picture fuzzy graph. Finally, we describe the utility of the picture fuzzy graph and its application in a social network.


2016 ◽  
Vol 841 ◽  
pp. 184-191 ◽  
Author(s):  
Said Broumi ◽  
Florentin Smarandache ◽  
Mohamed Talea ◽  
Assia Bakali

In this paper, we first define the concept of bipolar single neutrosophic graphs as the generalization of bipolar fuzzy graphs, N-graphs, intuitionistic fuzzy graph, single valued neutrosophic graphs and bipolar intuitionistic fuzzy graphs.


2021 ◽  
Vol 2021 ◽  
pp. 1-21
Author(s):  
Sami Ullah Khan ◽  
Naeem Jan ◽  
Kifayat Ullah ◽  
Lazim Abdullah

The theory developed in this article is based on graphs of cubic intuitionistic fuzzy sets (CIFS) called cubic intuitionistic fuzzy graphs (CIFGs). This graph generalizes the structures of fuzzy graph (FG), intuitionistic fuzzy graph (IFG), and interval-valued fuzzy graph (IVFG). Moreover, several associated concepts are established for CIFG, such as the idea subgraphs, degree of CIFG, order of CIFG, complement of CIFG, path in CIFG, strong CIFG, and the concept of bridges for CIFGs. Furthermore, the generalization of CIFG is proved with the help of some remarks. In addition, the comparison among the existing and the proposed ideas is carried out. Finally, an application of CIFG in decision-making problem is studied, and some future study is proposed.


Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 588 ◽  
Author(s):  
Songyi Yin ◽  
Hongxu Li ◽  
Yang Yang

The q-rung orthopair fuzzy graph is an extension of intuitionistic fuzzy graph and Pythagorean fuzzy graph. In this paper, the degree and total degree of a vertex in q-rung orthopair fuzzy graphs are firstly defined. Then, some product operations on q-rung orthopair fuzzy graphs, including direct product, Cartesian product, semi-strong product, strong product, and lexicographic product, are defined. Furthermore, some theorems about the degree and total degree under these product operations are put forward and elaborated with several examples. In particular, these theorems improve the similar results in single-valued neutrosophic graphs and Pythagorean fuzzy graphs.


2019 ◽  
Vol 8 (4) ◽  
pp. 2902-2905 ◽  

Graph theory has applications in many areas of computer science, including data mining, image segmentation, clustering and networking. Product on graphs has a wide range of application in networking system, automata theory, game theory and structural mechanics. In many cases, some aspects of a graph-theoretic problem may be uncertain. Intuitionistic fuzzy models provide more compatible to the system compared to the fuzzy models. An intuitionistic fuzzy graph can be derived from two given intuitionistic fuzzy graphs using max-product. In this paper, we studied the degree of vertex in intuitionistic fuzzy graph by the max-product of two given intuitionistic fuzzy graph. Also find the necessary and sufficient condition for max-product of two intuitionistic fuzzy graphs to be regular.


Sign in / Sign up

Export Citation Format

Share Document