Accessible single-valued neutrosophic graphs

Abstract

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.

On KM-Fuzzy Metric Hypergraphs

“…Kaufmann [8], introduced and provided the theory of fuzzy hypergraphs as a generalisation of concept of hypergraphs, in such a way that fuzzy hypergraphs have important applications to decision making, mobile network and similar applications [9,10]. Further materials regarding graphs and hypergraphs are available in the literature too [11][12][13][14][15][16][17][18][19][20][21][22][23].…”

Single–valued neutrosophic filters in EQ–algebras

“…Filters are very important in the proof of the completeness of various logic algebras. Many researchers have studied the filter theory of various logical algebras [3,4,5].…”

Strong Degrees in Single Valued Neutrosophic Graphs

“…After that, several authors are focused on the study of SVNGs and many extensions of SVNGs have been developed. Hamidi and Borumand Saeid [25] defined the notion of accessible-SVNGs and apply it social networks. In [24], Mehra and Manjeet defined the notion of single valued neutrosophic signed graphs.…”