Single-valued Neutrosophic Graphs Research Articles

A Novel Approach on Energy of λJ-dominating Single-Valued Neutrosophic Graph Structure

The concept of dominance is one of the most important ideas in graph theory for handling random events, and it has drawn the interest from many scholars. Research related to graph energy has garnered a lot focus recently. The application of single-valued neutrosophic graphs (SVNGs) for energy, Laplacian energy, and dominating energy has been recommended by previous studies. In this research, we apply the concepts of single-valued neutrosophic sets (SVNS) to graph structures (GSs) and investigate some intriguing features of single-valued neutrosophic graph structures (SVNGS). Moreover, the notions of λJ-dominating energy GS in an SVNGS environment are analyzed in this study. More specifically, illustrative examples are used to develop the adjacency matrix of a λJ-dominating SVNGS, as well as the spectrum of the adjacency matrix and their related theory. Further, the SVNGS λJ-dominating energy is determined. We go over various characteristics and constraints for the energy of SVNGS with λJ-dominating. Further, we introduce the idea of isomorphic and identical λJ-dominating SVNGS energy, which has been studied using relevant examples, and some of its established properties are presented.

Analysis of the Major Investment Object by Using a Novel Approach Based on Neutrosophic Information.

Neutrosophic set (NS) is an extensively used framework whenever the imprecision and uncertainty of an event is described based on three possible aspects. The association, neutral, and nonassociation degrees are the three unique aspects of an NS. More importantly, these degrees are independent which is a great plus point. On the contrary, neutrosophic graphs (NGs) and single-valued NGs (SVNGs) are applicable to deal with events that contain bulks of information. However, the concept of degrees in NGs is a handful tool for solving the problems of decision-making (DM), pattern recognition, social network, and communication network. This manuscript develops various forms of edge irregular SVNG (EISVNG), highly edge irregular SVNG (HEISVNG), strongly (EISVNG), strongly (ETISVNG), and edge irregularity on a cycle and a path in SVNGs. All these novel notions are supported by definitions, theorems, mathematical proofs, and illustrative examples. Moreover, two types of DM problems are modelled using the proposed framework. Furthermore, the computational processes are used to confirm the validity of the proposed graphs. Furthermore, the results approve that the decision-making problems can be addressed by the edge irregular neutrosophic graphical structures. In addition, the comparison between proposed and the existing methodologies is carried out.

Secure Edge Domination in Neutrosophic Graphs

The concepts of Neutrosophic secure edge domination number and neutrosophic total secure edge domination number in single valued neutrosophic graphs (SVNG) with strong arcs are introduced and analysed in this paper, and some of their properties are studied. The relationship between the neutrosophic secure edge dominance number and its inverse is presented. The concepts inverse neutrosophic total edge domination set and inverse neutrosophic total edge domination number are also defined. Some of these concepts' properties are investigated.

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

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.

Complementary domination in Single valued neutrosophic graphs

This paper deals with the concept of complementary domination corresponding to a Single valued neutrosophic graphs (SVNG). Further we study the bounds and characteristic of an inverse domination number (IDN) in various SVNG. A set I⊆Vis supposed to be an CDS in SVNG’s G(A,B)if D⊆Vremains a DS of G. I⊆(V-D) is a DS of V-D . The least among all the CDS’s is called an CDN γCD(G) of G(A,B). In this paper, we bring together the notion of a complementary domination (CD) in Single valued neutrosophic graphs (SVNG). Further we study the bounds as well as characteristic of a complementary domination number (CDN) in various SVNG.

A New Multi-Attribute Decision Making Method with Single-Valued Neutrosophic Graphs

A New Multi-Attribute Decision Making Method with Single-Valued Neutrosophic Graphs

A New Multi-Attribute Decision Making Method with Single-Valued Neutrosophic Graphs

A New Multi-Attribute Decision Making Method with Single-Valued Neutrosophic Graphs

A Study on Bipolar Single-Valued Neutrosophic Graphs With Novel Application

A Study on Bipolar Single-Valued Neutrosophic Graphs With Novel Application

A New Multi-Attribute Decision Making Method with Single-Valued Neutrosophic Graphs

In most realistic situations, the theory and method of multi-attribute decision-making have been widely used in different fields, such as engineering, economy, management, military, and others. Although many studies in some extended fuzzy contexts have been explored with multi-attribute decision-making, it is widely recognized that single-valued neutrosophic sets can describe incomplete, indeterminate and inconsistent information more easier. In this paper, aiming at addressing multi-attribute decision-making problems with single-valued neutrosophic information, related models and multi-attribute decision-making approaches based on the fuzzy graph theory are studied. In specific, the notion of single-valued neutrosophic sets and graphs is firstly introduced together with several common operational laws. Then a multi-attribute decision making method based on single-valued neutrosophic graphs is established. Finally, an illustrative example and a comparative analysis are conducted to verify the feasibility and efficiency of the proposed method.

Introduction of some new results on interval-valued neutrosophic graphs

In this paper, inspired by the concept of generalized single-valued neutrosophic graphs(GSVNG) of the first type, we define yet another generalization of neutrosophic graph called the generalized interval-valued neutrosophic graph of 1 type (GIVNG1) in addition to our previous work on complex neutrosophic graph (CNG1) in [47]. We will also show a matrix representation for this new generalization. Many of the fundamental properties and characteristics of this new concept is also studied. Like the concept CNG1 in [47], the concept of GIVNG1 is another extension of generalized fuzzy graphs 1 (GFG1) and GSVNG1.

Product Operations on q-Rung Orthopair Fuzzy Graphs

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.

Constant single valued neutrosophic graphs with applications

In this paper, we introduced a new concept of a single-valued neutrosophic graph (SVNG) known as a constant single-valued neutrosophic graph (CSVNG). Basically, SVNG is a generalization of intuitionistic fuzzy graph (IFG). More specifically, we described and explored some graph-theoretic ideas related to the introduced concepts of CSVNG. An application of CSVNG in a Wi-Fi network system is discussed and a comparison of CSVNG with constant IFG is established showing the worth of the proposed work. Further, several terms like constant function and totally constant function are investigated in the framework of CSVNG and their characteristics are studied.

Novel applications of bipolar single-valued neutrosophic competition graphs

Bipolar single-valued neutrosophic models are the generalization of bipolar fuzzy models. We first introduce the concept of bipolar single-valued neutrosophic competition graphs. We then, discuss some important propositions related to bipolar single-valued neutrosophic competition graphs. We define bipolar single-valued neutrosophic economic competition graphs and m-step bipolar single-valued neutrosophic economic competition graphs. Further, we describe applications of bipolar single-valued neutrosophic competition graphs in organizational designations and brands competition. Finally, we present our improved methods by algorithms.

Novel System and Method for Telephone Network Planing based on Neutrosophic Graph

Telephony is gaining momentum in the daily lives of individuals and in the activities of all companies. With the great trend towards telephony networks, whether analogue or digital known as Voice over IP (VoIP), the number of calls an individual can receive becomes considerably high.However, effective management of incoming calls to subscribers becomes a necessity. Recently,much attention has been paid towards applications of single-valued neutrosophic graphs in various research fields.

Achievable Single-Valued Neutrosophic Graphs in Wireless Sensor Networks

This is an unedited version of the accepted manuscript scheduled for publication. It has been uploaded in advance for the benefit of our customers. The manuscript will be copyedited, typeset and proofread before it is released in the final form.

Certain Notions of Energy in Single-Valued Neutrosophic Graphs

A single-valued neutrosophic set is an instance of a neutrosophic set, which provides us an additional possibility to represent uncertainty, imprecise, incomplete and inconsistent information existing in real situations. In this research study, we present concepts of energy, Laplacian energy and signless Laplacian energy in single-valued neutrosophic graphs (SVNGs), describe some of their properties and develop relationship among them. We also consider practical examples to illustrate the applicability of the our proposed concepts.

Achievable Single-Valued Neutrosophic Graphs in Wireless Sensor Networks

This paper considers wireless sensor (hyper) networks by single-valued neutrosophic (hyper)graphs. It tries to extend the notion of single-valued neutrosophic graphs to single-valued neutrosophic hypergraphs and it is derived single-valued neutrosophic graphs from single-valued neutrosophic hypergraphs via positive equivalence relation. We use single-valued neutrosophic hypergraphs and positive equivalence relation to create the sensor clusters and access to cluster heads. Finally, the concept of (extended) derivable single-valued neutrosophic graph is considered as the energy clustering of wireless sensor networks and is applied this concept as a tool in wireless sensor (hyper) networks.

Some Results on the Graph Theory for Complex Neutrosophic Sets

Fuzzy graph theory plays an important role in the study of the symmetry and asymmetry properties of fuzzy graphs. With this in mind, in this paper, we introduce new neutrosophic graphs called complex neutrosophic graphs of type 1 (abbr. CNG1). We then present a matrix representation for it and study some properties of this new concept. The concept of CNG1 is an extension of the generalized fuzzy graphs of type 1 (GFG1) and generalized single-valued neutrosophic graphs of type 1 (GSVNG1). The utility of the CNG1 introduced here are applied to a multi-attribute decision making problem related to Internet server selection.

Properties of single-valued neutrosophic graphs

Properties of single-valued neutrosophic graphs

Accessible single-valued neutrosophic graphs

This paper derived single-valued neutrosophic graphs from single-valued neutrosophic hypergraphs via strong equivalence relation. We show that any weak single-valued neutrosophic graph is a derived single-valued neutrosophic graph and any linear weak single-valued neutrosophic tree is an extendable linear single-valued neutrosophic tree.