Single-Valued Neutrosophic Hypergraphs

Akram, Muhammad; Shahzadi, Sundas; Saeid, Arsham Borumand

doi:10.26837/jaem.377615

Cited by 44 publications

(66 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To extend the concept of IFGs, Broumi et al [20] defined single-valued neutrosophic graphs (SVNGs) and investigated some of their properties such as strong SVNGs, constant SVNGs, and complete SVNGs. Certain operations on SVNGs were studied by Akram and Shahzadi [21]. Single-valued neutrosophic planar graphs were defined by Akram [22].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Complex Neutrosophic Hypergraphs: New Social Network Models

2019

Self Cite

View full text Add to dashboard Cite

A complex neutrosophic set is a useful model to handle indeterminate situations with a periodic nature. This is characterized by truth, indeterminacy, and falsity degrees which are the combination of real-valued amplitude terms and complex-valued phase terms. Hypergraphs are objects that enable us to dig out invisible connections between the underlying structures of complex systems such as those leading to sustainable development. In this paper, we apply the most fruitful concept of complex neutrosophic sets to theory of hypergraphs. We define complex neutrosophic hypergraphs and discuss their certain properties including lower truncation, upper truncation, and transition levels. Furthermore, we define T-related complex neutrosophic hypergraphs and properties of minimal transversals of complex neutrosophic hypergraphs. Finally, we represent the modeling of certain social networks with intersecting communities through the score functions and choice values of complex neutrosophic hypergraphs. We also give a brief comparison of our proposed model with other existing models.

show abstract

Section: Introductionmentioning

confidence: 99%

“…They converted an IFN into intuitionistic fuzzy scores and find the IF shortest hyperpath in the network using the scores and accuracy values. Akram and Shahzadi [33] introduced SVN hypergraphs. Akram and Luqman [34] defined intuitionistic single-valued neutrosophic hypergraphs.…”

Section: Introductionmentioning

confidence: 99%

Complex Neutrosophic Hypergraphs: New Social Network Models

2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…E-mail: m.hamidi@pnu.ac.ir. ical systems and genetic code of biology [2]. From the point of view of logic, the main difference between residuated lattices and EQ-algebras lies in the way the implication operation is obtained.…”

Section: Introductionmentioning

confidence: 99%

Single–valued neutrosophic filters in EQ–algebras

Hamidi

Saeid

Smarandache

2019

IFS

Self Cite

View full text Add to dashboard Cite

show abstract

“…In 1995, Smarandache introduced "neutrosophic set" by adding the concept of degree of indeterminate membership to the intuitionistic fuzzy set [10]. There are three different types of definitions of a neutrosophic graph [1,4,8]. Broumi et al [4] and Shah-Hussain [8] introduced two different definitions of neutrosophic graph by generalizations of intuitionistic fuzzy graph [9].…”

Section: Introductionmentioning

confidence: 99%

“…Broumi et al [4] and Shah-Hussain [8] introduced two different definitions of neutrosophic graph by generalizations of intuitionistic fuzzy graph [9]. Akram and shahzadi introduced neutrosophic graph by using concept of neutrosophic set [1]. They also highlighted [1] some flaws in the definitions of Broumi et al [4] and Shah-Hussain [8].…”

Section: Introductionmentioning

confidence: 99%

Nikfar Domination in Neutrosophic Graphs

M¹

2019

Preprint

View full text Add to dashboard Cite

Many various using of this new-born fuzzy model for solving real-world problems and urgent requirements involve introducing new concept for analyzing the situations which leads to solve them by proper, quick and ecient method based on statistical data. This gap between the model and its solution cause that we introduce nikfar domination in neutrosophic graphs as creative and eective tool for studying a few selective vertices of this model instead of all ones by using special edges. Being special selection of these edges aect to achieve quick and proper solution to these problems. Domination hasn't ever been introduced. So we don't have any comparison with another denitions. The most used graphs which have properties of being complete, empty, bipartite, tree and like stu and they also achieve the names for themselves, are studied as fuzzy models for getting nikfar dominating set or at least becoming so close to it. We also get the relations between this special edge which plays main role in doing dominating with other special types of edges of graph like bridges. Finally, the relation between this number with other special numbers and characteristic of graph like order are discussed.

show abstract

Single-Valued Neutrosophic Hypergraphs

Abstract: We introduce certain concepts, including single-valued neutrosophic hypergraph, line graph of single-valued neutrosophic hypergraph, dual single-valued neutrosophic hypergraph and transversal single-valued neutrosophic hypergraph.

Cited by 44 publications

References 2 publications

Complex Neutrosophic Hypergraphs: New Social Network Models

Complex Neutrosophic Hypergraphs: New Social Network Models

Single–valued neutrosophic filters in EQ–algebras

Nikfar Domination in Neutrosophic Graphs

Contact Info

Product

Resources

About