Abstract
The concept of intuitionistic neutrosophic sets provides an additional possibility to represent imprecise, uncertain, inconsistent and incomplete information, which exists in real situations. This research article first presents the notion of intuitionistic neutrosophic competition graphs. Then, p-competition intuitionistic neutrosophic graphs and m-step intuitionistic neutrosophic competition graphs are discussed. Further, applications of intuitionistic neutrosophic competition graphs in ecosystem and career competition are described.
Highlights
Euler [1] introduced the concept of graph theory in 1736, which has applications in various fields, including image capturing, data mining, clustering and computer science [2,3,4,5]
In order to cope with this issue, neutrosophic set theory was proposed by Smarandache [7] as a generalization of fuzzy sets and intuitionistic fuzzy sets
The single-valued intuitionistic neutrosophic open-neighborhood graph of G is an IN-graph N(G) = ( X, h, k0 ), which has the same intuitionistic neutrosophic set of vertices in G and has an intuitionistic neutrosophic edge between two vertices w, z ∈ X in N(G) if and only if N(w) ∩ N(z) is a non-empty IN-set in G
Summary
Euler [1] introduced the concept of graph theory in 1736, which has applications in various fields, including image capturing, data mining, clustering and computer science [2,3,4,5]. In 2010 defined the concept of single-valued neutrosophic sets and their operations as a generalization of intuitionistic fuzzy sets. Yang et al [10] introduced the concept of the single-valued neutrosophic relation based on the single-valued neutrosophic set. The concept of the single-valued intuitionistic neutrosophic set was proposed by Bhowmik and Pal [11,12]. Akram and Shahzadi [28] introduced the notion of a single-valued neutrosophic graph and studied some of its operations. They discussed the properties of single-valued neutrosophic graphs by level graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.