scholarly journals Novel Concept of Energy in Bipolar Single-Valued Neutrosophic Graphs with Applications

Axioms ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 172
Author(s):  
Siti Nurul Fitriah Mohamad ◽  
Roslan Hasni ◽  
Florentin Smarandache ◽  
Binyamin Yusoff

The energy of a graph is defined as the sum of the absolute values of its eigenvalues. Recently, there has been a lot of interest in graph energy research. Previous literature has suggested integrating energy, Laplacian energy, and signless Laplacian energy with single-valued neutrosophic graphs (SVNGs). This integration is used to solve problems that are characterized by indeterminate and inconsistent information. However, when the information is endowed with both positive and negative uncertainty, then bipolar single-valued neutrosophic sets (BSVNs) constitute an appropriate knowledge representation of this framework. A BSVNs is a generalized bipolar fuzzy structure that deals with positive and negative uncertainty in real-life problems with a larger domain. In contrast to the previous study, which directly used truth and indeterminate and false membership, this paper proposes integrating energy, Laplacian energy, and signless Laplacian energy with BSVNs to graph structure considering the positive and negative membership degree to greatly improve decisions in certain problems. Moreover, this paper intends to elaborate on characteristics of eigenvalues, upper and lower bound of energy, Laplacian energy, and signless Laplacian energy. We introduced the concept of a bipolar single-valued neutrosophic graph (BSVNG) for an energy graph and discussed its relevant ideas with the help of examples. Furthermore, the significance of using bipolar concepts over non-bipolar concepts is compared numerically. Finally, the application of energy, Laplacian energy, and signless Laplacian energy in BSVNG are demonstrated in selecting renewable energy sources, while optimal selection is suggested to illustrate the proposed method. This indicates the usefulness and practicality of this proposed approach in real life.

Author(s):  
Said Broumi ◽  
Selçuk Topal ◽  
Assia Bakali ◽  
Mohamed Talea ◽  
Florentin Smarandache

Recently, single valued neutrosophic sets and interval valued neutrosophic sets have received great attention among the scholars and have been applied in many applications. These two concepts handle the indeterminacy and consistent information existing in real-life problems. In this chapter, a new Python toolbox is proposed under neutrosophic environment, which consists of some Python code for single valued neutrosophic matrices and interval valued neutrosophic matrices. Some definitions of interval neutrosophic vague set such as union, complement, and intersection are presented. Furthermore, the related examples are included.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Sami Ullah Khan ◽  
Abdul Nasir ◽  
Naeem Jan ◽  
Zhen-Hua Ma

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.


Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1647
Author(s):  
Yongsheng Rao ◽  
Saeed Kosari ◽  
Zehui Shao

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.


Mathematics ◽  
2019 ◽  
Vol 7 (6) ◽  
pp. 551 ◽  
Author(s):  
Liangsong Huang ◽  
Yu Hu ◽  
Yuxia Li ◽  
P. K. Kishore Kumar ◽  
Dipak Koley ◽  
...  

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.


Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 945
Author(s):  
Saba Ayub ◽  
Muhammad Shabir ◽  
Muhammad Riaz ◽  
Muhammad Aslam ◽  
Ronnason Chinram

Binary relations are most important in various fields of pure and applied sciences. The concept of linear Diophantine fuzzy sets (LDFSs) proposed by Riaz and Hashmi is a novel mathematical approach to model vagueness and uncertainty in decision-making problems. In LDFS theory, the use of reference or control parameters corresponding to membership and non-membership grades makes it most accommodating towards modeling uncertainties in real-life problems. The main purpose of this paper is to establish a robust fusion of binary relations and LDFSs, and to introduce the concept of linear Diophantine fuzzy relation (LDF-relation) by making the use of reference parameters corresponding to the membership and non-membership fuzzy relations. The novel concept of LDF-relation is more flexible to discuss the symmetry between two or more objects that is superior to the prevailing notion of intuitionistic fuzzy relation (IF-relation). Certain basic operations are defined to investigate some significant results which are very useful in solving real-life problems. Based on these operations and their related results, it is analyzed that the collection of all LDF-relations gives rise to some algebraic structures such as semi-group, semi-ring and hemi-ring. Furthermore, the notion of score function of LDF-relations is introduced to analyze the symmetry of the optimal decision and ranking of feasible alternatives. Additionally, a new algorithm for modeling uncertainty in decision-making problems is proposed based on LDFSs and LDF-relations. A practical application of proposed decision-making approach is illustrated by a numerical example. Proposed LDF-relations, their operations, and related results may serve as a foundation for computational intelligence and modeling uncertainties in decision-making problems.


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Zafar Ullah ◽  
Huma Bashir ◽  
Rukhshanda Anjum ◽  
Salman A. AlQahtani ◽  
Suheer Al-Hadhrami ◽  
...  

The concept of fuzzy graph (FG) and its generalized forms has been developed to cope with several real-life problems having some sort of imprecision like networking problems, decision making, shortest path problems, and so on. This paper is based on some developments in generalization of FG theory to deal with situation where imprecision is characterized by four types of membership grades. A novel concept of T-spherical fuzzy graph (TSFG) is proposed as a common generalization of FG, intuitionistic fuzzy graph (IFG), and picture fuzzy graph (PFG) based on the recently introduced concept of T-spherical fuzzy set (TSFS). The significance and novelty of proposed concept is elaborated with the help of some examples, graphical analysis, and results. Some graph theoretic terms are defined and their properties are studied. Specially, the famous Dijkstra algorithm is proposed in the environment of TSFGs and is applied to solve a shortest path problem. The comparative analysis of the proposed concept and existing theory is made. In addition, the advantages of the proposed work are discussed over the existing tools.


2020 ◽  
Vol 12 (06) ◽  
pp. 2050078
Author(s):  
Fateme Movahedi

Let [Formula: see text] be a graph of the order [Formula: see text] and size [Formula: see text]. The minimum edge dominating energy is defined as the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of the graph [Formula: see text]. In this paper, we establish relations between the minimum edge dominating energy of a graph [Formula: see text] and the graph energy, the energy of the line graph, signless Laplacian energy of [Formula: see text].


Mathematics ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 72 ◽  
Author(s):  
Naeem Jan ◽  
Kifayat Ullah ◽  
Tahir Mahmood ◽  
Harish Garg ◽  
Bijan Davvaz ◽  
...  

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.


Author(s):  
Jayanta Pratihar ◽  
Ranjan Kumar ◽  
Arindam Dey ◽  
Said Broumi

The transportation problem (TP) is popular in operation research due to its versatile applications in real life. Uncertainty exists in most of the real-life problems, which cause it laborious to find the cost (supply/demand) exactly. The fuzzy set is the well-known field for handling the uncertainty but has some limitations. For that reason, in this chapter introduces another set of values called neutrosophic set. It is a generalization of crisp sets, fuzzy set, and intuitionistic fuzzy set, which is handle the uncertain, unpredictable, and insufficient information in real-life problem. Here consider some neutrosophic sets of values for supply, demand, and cell cost. In this chapter, extension of linear programming principle, extension of north west principle, extension of Vogel's approximation method (VAM) principle, and extended principle of MODI method are used for solving the TP with neutrosophic environment called neutrosophic transportation problem (NTP), and these methods are compared using neutrosophic sets of value as well as a combination of neutrosophic and crisp value for analyzing the every real-life uncertain situation.


1970 ◽  
Author(s):  
Matisyohu Weisenberg ◽  
Carl Eisdorfer ◽  
C. Richard Fletcher ◽  
Murray Wexler

Sign in / Sign up

Export Citation Format

Share Document