This study is designed with the renewed concept of neutrosophic soft graph (briefly ns-graph) which is a combination of graphs and neutrosophic soft sets. We re-define notions of ns-graphs and ns-subgraphs with the different perspective from the study in [4]. Also, we introduce some new operations on ns-graphs and detailed them with convenient examples. Moreover, we present an application of ns-graphs to determine of optimal object by using given data with the help of an algorithm. This algorithm we developed is new inventiveness domain for problems which are involving uncertainty, and effectively finds the optimal result between the states where vagueness exists. We also provide a comparative analysis with the existing method given in [4].
Primary Language | English |
---|---|
Subjects | Mathematical Sciences |
Journal Section | Research Articles |
Authors | |
Publication Date | December 29, 2023 |
Submission Date | January 13, 2023 |
Acceptance Date | July 15, 2023 |
Published in Issue | Year 2023 |
Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics.
This work is licensed under a Creative Commons Attribution 4.0 International License.