scholarly journals Certain Properties of Vague Graphs with a Novel Application

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1647
Author(s):  
Yongsheng Rao ◽  
Saeed Kosari ◽  
Zehui Shao
Keyword(s):  
Social Systems ◽  
Sufficient Conditions ◽  
Real Life ◽  
Laplacian Matrix ◽  
Fuzzy Graph ◽  
Fuzzy Graphs ◽  
Life Problems ◽  
Real World Problem ◽  
Laplacian Energy ◽  
Definition Of

Fuzzy graph models enjoy the ubiquity of being present in nature and man-made structures, such as the dynamic processes in physical, biological, and social systems. As a result of inconsistent and indeterminate information inherent in real-life problems that are often uncertain, for an expert, it is highly difficult to demonstrate those problems through a fuzzy graph. Resolving the uncertainty associated with the inconsistent and indeterminate information of any real-world problem can be done using a vague graph (VG), with which the fuzzy graphs may not generate satisfactory results. The limitations of past definitions in fuzzy graphs have led us to present new definitions in VGs. The objective of this paper is to present certain types of vague graphs (VGs), including strongly irregular (SI), strongly totally irregular (STI), neighborly edge irregular (NEI), and neighborly edge totally irregular vague graphs (NETIVGs), which are introduced for the first time here. Some remarkable properties associated with these new VGs were investigated, and necessary and sufficient conditions under which strongly irregular vague graphs (SIVGs) and highly irregular vague graphs (HIVGs) are equivalent were obtained. The relation among strongly, highly, and neighborly irregular vague graphs was established. A comparative study between NEI and NETIVGs was performed. Different examples are provided to evaluate the validity of the new definitions. A new definition of energy called the Laplacian energy (LE) is presented, and its calculation is shown with some examples. Likewise, we introduce the notions of the adjacency matrix (AM), degree matrix (DM), and Laplacian matrix (LM) of VGs. The lower and upper bounds for the Laplacian energy of a VG are derived. Furthermore, this study discusses the VG energy concept by providing a real-time example. Finally, an application of the proposed concepts is presented to find the most effective person in a hospital.

scholarly journals A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications

Mathematics ◽  
2019 ◽  
Vol 7 (6) ◽  
pp. 551 ◽  
Author(s):  
Liangsong Huang ◽  
Yu Hu ◽  
Yuxia Li ◽  
P. K. Kishore Kumar ◽  
Dipak Koley ◽  
...  
Keyword(s):  
Graph Theory ◽  
Optimization Problems ◽  
Real Life ◽  
Road Transport ◽  
Fuzzy Graph ◽  
Fuzzy Graphs ◽  
Life Problems ◽  
Real World Problem ◽  
Neutrosophic Graph ◽  
Definition Of

Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those problems using a fuzzy graph. A neutrosophic graph can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results. The concepts of the regularity and degree of a node play a significant role in both the theory and application of graph theory in the neutrosophic environment. In this work, we describe the utility of the regular neutrosophic graph and bipartite neutrosophic graph to model an assignment problem, a road transport network, and a social network. For this purpose, we introduce the definitions of the regular neutrosophic graph, star neutrosophic graph, regular complete neutrosophic graph, complete bipartite neutrosophic graph, and regular strong neutrosophic graph. We define the d m - and t d m -degrees of a node in a regular neutrosophic graph. Depending on the degree of the node, this paper classifies the regularity of a neutrosophic graph into three types, namely d m -regular, t d m -regular, and m-highly irregular neutrosophic graphs. We present some theorems and properties of those regular neutrosophic graphs. The concept of an m-highly irregular neutrosophic graph on cycle and path graphs is also investigated in this paper. The definition of busy and free nodes in a regular neutrosophic graph is presented here. We introduce the idea of the μ -complement and h-morphism of a regular neutrosophic graph. Some properties of complement and isomorphic regular neutrosophic graphs are presented here.

scholarly journals A Novel Description on Vague Graph with Application in Transportation Systems

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Zheng Kou ◽  
Saeed Kosari ◽  
Maryam Akhoundi
Keyword(s):  
Social Systems ◽  
Real Life ◽  
Transportation Systems ◽  
Fuzzy Graph ◽  
Network Heterogeneity ◽  
Life Problems ◽  
Real World Problem ◽  
Vague Graph ◽  
Ecology And Economy

Fuzzy graph (FG) models embrace the ubiquity of existing in natural and man-made structures, specifically dynamic processes in physical, biological, and social systems. It is exceedingly difficult for an expert to model those problems based on a FG because of the inconsistent and indeterminate information inherent in real-life problems being often uncertain. Vague graph (VG) can deal with the uncertainty associated with the inconsistent and determinate information of any real-world problem, where FGs many fail to reveal satisfactory results. Regularity definitions have been of high significance in the network heterogeneity study, which have implications in networks found across biology, ecology, and economy; so, adjacency sequence (AS) and fundamental sequences (FS) of regular vague graphs (RVGs) are defined with examples. One essential and adequate prerequisite has been ascribed to a VG with maximum four vertices is that it should be regular based on the adjacency sequences concept. Likewise, it is described that if ζ and its principal crisp graph (CG) are regular, then all the nodes do not have to have the similar AS. In the following, we obtain a characterization of vague detour (VD) g-eccentric node, and the concepts of vague detour g-boundary nodes and vague detour g-interior nodes in a VG are examined. Finally, an application of vague detour g-distance in transportation systems is given.

scholarly journals Vague Graph Structure with Application in Medical Diagnosis

Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1582
Author(s):  
Saeed Kosari ◽  
Yongsheng Rao ◽  
Huiqin Jiang ◽  
Xinyue Liu ◽  
Pu Wu ◽  
...  
Keyword(s):  
Medical Diagnosis ◽  
Social Systems ◽  
Medical Science ◽  
Real Life ◽  
Image Clustering ◽  
Graph Structure ◽  
Fuzzy Graph ◽  
Fuzzy Graphs ◽  
Life Problems ◽  
Vague Graph

Fuzzy graph models enjoy the ubiquity of being in natural and human-made structures, namely dynamic process in physical, biological and social systems. As a result of inconsistent and indeterminate information inherent in real-life problems which are often uncertain, it is highly difficult for an expert to model those problems based on a fuzzy graph (FG). Vague graph structure (VGS) can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results. Likewise, VGSs are very useful tools for the study of different domains of computer science such as networking, capturing the image, clustering, and also other issues like bioscience, medical science, and traffic plan. The limitations of past definitions in fuzzy graphs have led us to present new definitions in VGSs. Operations are conveniently used in many combinatorial applications. In various situations, they present a suitable construction means; therefore, in this research, three new operations on VGSs, namely, maximal product, rejection, residue product were presented, and some results concerning their degrees and total degrees were introduced. Irregularity definitions have been of high significance in the network heterogeneity study, which have implications in networks found across biology, ecology and economy; so special concepts of irregular VGSs with several key properties were explained. Today one of the most important applications of decision making is in medical science for diagnosing the patient’s disease. Hence, we recommend an application of VGS in medical diagnosis.

scholarly journals New Concepts of Picture Fuzzy Graphs with Application

Mathematics ◽  
2019 ◽  
Vol 7 (5) ◽  
pp. 470 ◽  
Author(s):  
Cen Zuo ◽  
Anita Pal ◽  
Arindam Dey
Keyword(s):  
Fuzzy Set ◽  
Cartesian Product ◽  
Intuitionistic Fuzzy Set ◽  
Real Life ◽  
Fuzzy Graph ◽  
Intuitionistic Fuzzy ◽  
Strong Product ◽  
Fuzzy Graphs ◽  
Life Problems ◽  
Picture Fuzzy Set

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.

scholarly journals Some Root Level Modifications in Interval Valued Fuzzy Graphs and Their Generalizations Including Neutrosophic Graphs

Mathematics ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 72 ◽  
Author(s):  
Naeem Jan ◽  
Kifayat Ullah ◽  
Tahir Mahmood ◽  
Harish Garg ◽  
Bijan Davvaz ◽  
...  
Keyword(s):  
Decision Making ◽  
Essential Role ◽  
Real Life ◽  
Current Definition ◽  
Fuzzy Graphs ◽  
Life Problems ◽  
Decision Making Problem ◽  
Neutrosophic Graph ◽  
Definition Of ◽  
Interval Valued

Fuzzy graphs (FGs) and their generalizations have played an essential role in dealing with real-life problems involving uncertainties. The goal of this article is to show some serious flaws in the existing definitions of several root-level generalized FG structures with the help of some counterexamples. To achieve this, first, we aim to improve the existing definition for interval-valued FG, interval-valued intuitionistic FG and their complements, as these existing definitions are not well-defined; i.e., one can obtain some senseless intervals using the existing definitions. The limitations of the existing definitions and the validity of the new definitions are supported with some examples. It is also observed that the notion of a single-valued neutrosophic graph (SVNG) is not well-defined either. The consequences of the existing definition of SVNG are discussed with the help of examples. A new definition of SVNG is developed, and its improvement is demonstrated with some examples. The definition of an interval-valued neutrosophic graph is also modified due to the shortcomings in the current definition, and the validity of the new definition is proved. An application of proposed work is illustrated through a decision-making problem under the framework of SVNG, and its performance is compared with existing work.

scholarly journals A Survey on Domination in Vague Graphs with Application in Transferring Cancer Patients between Countries

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1258
Author(s):  
Yongsheng Rao ◽  
Ruxian Chen ◽  
Pu Wu ◽  
Huiqin Jiang ◽  
Saeed Kosari
Keyword(s):  
Dominating Set ◽  
Sufficient Conditions ◽  
Real Life ◽  
Practical Interest ◽  
Independent Set ◽  
Fuzzy Graph ◽  
Edge Dominating Set ◽  
Fuzzy Graphs ◽  
Wide Range ◽  
Dominance Set

Many problems of practical interest can be modeled and solved by using fuzzy graph (FG) algorithms. In general, fuzzy graph theory has a wide range of application in various fields. Since indeterminate information is an essential real-life problem and is often uncertain, modeling these problems based on FG is highly demanding for an expert. A vague graph (VG) can manage the uncertainty relevant to the inconsistent and indeterminate information of all real-world problems in which fuzzy graphs may not succeed in bringing about satisfactory results. Domination in FGs theory is one of the most widely used concepts in various sciences, including psychology, computer sciences, nervous systems, artificial intelligence, decision-making theory, etc. Many research studies today are trying to find other applications for domination in their field of interest. Hence, in this paper, we introduce different kinds of domination sets, such as the edge dominating set (EDS), the total edge dominating set (TEDS), the global dominating set (GDS), and the restrained dominating set (RDS), in product vague graphs (PVGs) and try to represent the properties of each by giving some examples. The relation between independent edge sets (IESs) and edge covering sets (ECSs) are established. Moreover, we derive the necessary and sufficient conditions for an edge dominating set to be minimal and show when a dominance set can be a global dominance set. Finally, we try to explain the relationship between a restrained dominating set and a restrained independent set with an example. Today, we see that there are still diseases that can only be treated in certain countries because they require a long treatment period with special medical devices. One of these diseases is leukemia, which severely affects the immune system and the body’s defenses, making it impossible for the patient to continue living a normal life. Therefore, in this paper, using a dominating set, we try to categorize countries that are in a more favorable position in terms of medical facilities, so that we can transfer the patients to a suitable hospital in the countries better suited in terms of both cost and distance.

On Laplacian energy of picture fuzzy graphs in site selection problem

2021 ◽  
pp. 1-18
Author(s):  
Mahima Poonia ◽  
Rakesh Kumar Bajaj
Keyword(s):  
Decision Making ◽  
Site Selection ◽  
Upper Bounds ◽  
Selection Problem ◽  
Hydropower Plant ◽  
Fuzzy Graph ◽  
Fuzzy Information ◽  
Fuzzy Graphs ◽  
Laplacian Energy ◽  
Selection For

In the present work, the adjacency matrix, the energy and the Laplacian energy for a picture fuzzy graph/directed graph have been introduced along with their lower and the upper bounds. Further, in the selection problem of decision making, a methodology for the ranking of the available alternatives has been presented by utilizing the picture fuzzy graph and its energy/Laplacian energy. For the shake of demonstrating the implementation of the introduced methodology, the task of site selection for the hydropower plant has been carried out as an application. The originality of the introduced approach, comparative remarks, advantageous features and limitations have also been studied in contrast with intuitionistic fuzzy and Pythagorean fuzzy information.

scholarly journals An Intuitionistic Fuzzy Graph’s Signless Laplacian Energy

2018 ◽  
Vol 7 (4.10) ◽  
pp. 892
Author(s):  
Obbu Ramesh ◽  
S. Sharief Basha
Keyword(s):  
Adjacency Matrix ◽  
Fuzzy Graph ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Graphs ◽  
Laplacian Energy ◽  
Signless Laplacian ◽  
Intuitionistic Fuzzy Graphs

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.   

scholarly journals Graphical Analysis of Covering and Paired Domination in the Environment of Neutrosophic Information

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Sami Ullah Khan ◽  
Abdul Nasir ◽  
Naeem Jan ◽  
Zhen-Hua Ma
Keyword(s):  
Graph Theory ◽  
Optimization Problems ◽  
Domination Number ◽  
Real Life ◽  
Graphical Analysis ◽  
Fuzzy Graphs ◽  
Life Problems ◽  
Neutrosophic Graph ◽  
Paired Domination ◽  
Intuitionistic Fuzzy Graphs

Neutrosophic graph (NG) is a powerful tool in graph theory, which is capable of modeling many real-life problems with uncertainty due to unclear, varying, and indeterminate information. Meanwhile, the fuzzy graphs (FGs) and intuitionistic fuzzy graphs (IFGs) may not handle these problems as efficiently as NGs. It is difficult to model uncertainty due to imprecise information and vagueness in real-world scenarios. Many real-life optimization problems are modeled and solved using the well-known fuzzy graph theory. The concepts of covering, matching, and paired domination play a major role in theoretical and applied neutrosophic environments of graph theory. Henceforth, the current study covers this void by introducing the notions of covering, matching, and paired domination in single-valued neutrosophic graph (SVNG) using the strong edges. Also, many attention-grabbing properties of these concepts are studied. Moreover, the strong covering number, strong matching number, and the strong paired domination number of complete SVNG, complete single-valued neutrosophic cycle (SVNC), and complete bipartite SVNG are worked out along with their fascinating properties.

scholarly journals The Method of Allocation Centers in Second Kind Fuzzy Graphs With the Largest Vitality Degree

2021 ◽  
Vol 7 (3) ◽  
Author(s):  
Alexander Bozhenyuk, Stanislav Belyakov, Margarita Knyazeva
Keyword(s):  
Fuzzy Set ◽  
Optimal Allocation ◽  
Optimal Location ◽  
Optimum Allocation ◽  
Service Center ◽  
Fuzzy Graph ◽  
Reachability Matrix ◽  
Fuzzy Graphs ◽  
Optimal Service ◽  
Definition Of

The problem of optimal allocation of service centers is considered in this paper. It is supposed that the information received from GIS is presented like second kind fuzzy graphs. Method of optimal location as method of finding vitality fuzzy set of second kind fuzzy graph is suggested. Basis of this method is building procedure of reachability matrix of second kind fuzzy graph in terms of reachability matrix of first kind fuzzy graph. This method allows solving not only problem of finding of optimal service centers location but also finding of optimal location k-centers with the greatest degree and selecting of service center numbers. The algorithm of the definition of vitality fuzzy set for second kind fuzzy graphs is considered. The example of finding optimum allocation centers in second kind fuzzy graph is considered too.

Sign in / Sign up

Export Citation Format

Share Document