Spanning Tree Problem with Neutrosophic Edge Weights

Spanning Tree Problem with Neutrosophic Edge Weights PDF

Author: Said Broumi

Publisher: Infinite Study

Published:

Total Pages: 10

ISBN-13:

DOWNLOAD EBOOK →

Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which classical fuzzy sets/models may fail to model properly. This paper introduces an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (abbr. UNWCG) where the arc/edge lengths are represented by a single valued neutrosophic numbers.

A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs

A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs PDF

Author: Arindam Dey

Publisher: Infinite Study

Published:

Total Pages: 7

ISBN-13:

DOWNLOAD EBOOK →

In this paper, we discuss the minimum spanning tree (MST) problem of an undirected neutrosophic weighted connected graph in which a single-valued neutrosophic number, instead of a real number/fuzzy number, is assigned to each arc as its arc length.We define this type of MST as neutrosophic minimum spanning tree (NMST).

Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs

Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs PDF

Author: G. Upender Reddy

Publisher: Infinite Study

Published:

Total Pages: 15

ISBN-13:

DOWNLOAD EBOOK →

The minimal spanning tree (MST) algorithms by using the edges weights were presented mainly by Prim’s and Kruskal’s algorithms. In this article we use the weights for the bipolar neutrosophic edges by using the score functions with the new model algorithms namely bipolar neutrosophic Prim’s algorithm and bipolar neutrosophic Kruskal’s algorithm. Further, we use the score functions to get the more appropriate results based on the algorithms.

Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree

Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree PDF

Author: Masoud Ghods

Publisher: Infinite Study

Published: 2020-10-01

Total Pages: 13

ISBN-13:

DOWNLOAD EBOOK →

In this paper, we first define the Neutrosophic tree using the concept of the strong cycle. We then define a strong spanning Neutrosophic tree. In the following, we propose an algorithm for detecting the maximum spanning tree in Neutrosophic graphs. Next, we discuss the Connectivity index and related theorems for Neutrosophic trees.

Collected Papers. Volume VII

Collected Papers. Volume VII PDF

Author: Florentin Smarandache

Publisher: Infinite Study

Published: 2022-02-01

Total Pages: 1002

ISBN-13:

DOWNLOAD EBOOK →

This seventh volume of Collected Papers includes 70 papers comprising 974 pages on (theoretic and applied) neutrosophics, written between 2013-2021 by the author alone or in collaboration with the following 122 co-authors from 22 countries: Mohamed Abdel-Basset, Abdel-Nasser Hussian, C. Alexander, Mumtaz Ali, Yaman Akbulut, Amir Abdullah, Amira S. Ashour, Assia Bakali, Kousik Bhattacharya, Kainat Bibi, R. N. Boyd, Ümit Budak, Lulu Cai, Cenap Özel, Chang Su Kim, Victor Christianto, Chunlai Du, Chunxin Bo, Rituparna Chutia, Cu Nguyen Giap, Dao The Son, Vinayak Devvrat, Arindam Dey, Partha Pratim Dey, Fahad Alsharari, Feng Yongfei, S. Ganesan, Shivam Ghildiyal, Bibhas C. Giri, Masooma Raza Hashmi, Ahmed Refaat Hawas, Hoang Viet Long, Le Hoang Son, Hongbo Wang, Hongnian Yu, Mihaiela Iliescu, Saeid Jafari, Temitope Gbolahan Jaiyeola, Naeem Jan, R. Jeevitha, Jun Ye, Anup Khan, Madad Khan, Salma Khan, Ilanthenral Kandasamy, W.B. Vasantha Kandasamy, Darjan Karabašević, Kifayat Ullah, Kishore Kumar P.K., Sujit Kumar De, Prasun Kumar Nayak, Malayalan Lathamaheswari, Luong Thi Hong Lan, Anam Luqman, Luu Quoc Dat, Tahir Mahmood, Hafsa M. Malik, Nivetha Martin, Mai Mohamed, Parimala Mani, Mingcong Deng, Mohammed A. Al Shumrani, Mohammad Hamidi, Mohamed Talea, Kalyan Mondal, Muhammad Akram, Muhammad Gulistan, Farshid Mofidnakhaei, Muhammad Shoaib, Muhammad Riaz, Karthika Muthusamy, Nabeela Ishfaq, Deivanayagampillai Nagarajan, Sumera Naz, Nguyen Dinh Hoa, Nguyen Tho Thong, Nguyen Xuan Thao, Noor ul Amin, Dragan Pamučar, Gabrijela Popović, S. Krishna Prabha, Surapati Pramanik, Priya R, Qiaoyan Li, Yaser Saber, Said Broumi, Saima Anis, Saleem Abdullah, Ganeshsree Selvachandran, Abdulkadir Sengür, Seyed Ahmad Edalatpanah, Shahbaz Ali, Shahzaib Ashraf, Shouzhen Zeng, Shio Gai Quek, Shuangwu Zhu, Shumaiza, Sidra Sayed, Sohail Iqbal, Songtao Shao, Sundas Shahzadi, Dragiša Stanujkić, Željko Stević, Udhayakumar Ramalingam, Zunaira Rashid, Hossein Rashmanlou, Rajkumar Verma, Luige Vlădăreanu, Victor Vlădăreanu, Desmond Jun Yi Tey, Selçuk Topal, Naveed Yaqoob, Yanhui Guo, Yee Fei Gan, Yingcang Ma, Young Bae Jun, Yuping Lai, Hafiz Abdul Wahab, Wei Yang, Xiaohong Zhang, Edmundas Kazimieras Zavadskas, Lemnaouar Zedam.

Neutrosophic Sets and Systems, Vol. 32, 2020

Neutrosophic Sets and Systems, Vol. 32, 2020 PDF

Author: Florentin Smarandache

Publisher: Infinite Study

Published:

Total Pages: 454

ISBN-13:

DOWNLOAD EBOOK →

“Neutrosophic Sets and Systems” has been created for publications on advanced studies in neutrosophy, neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics that started in 1995 and their applications in any field, such as the neutrosophic structures developed in algebra, geometry, topology, etc. Some articles in this issue: Parameter Reduction of Neutrosophic Soft Sets and Their Applications, Geometric Programming (NGP) Problems Subject to (⋁,.) Operator; the Minimum Solution, Ngpr Homeomorphism in Neutrosophic Topological Spaces, Generalized Neutrosophic Separation Axioms in Neutrosophic Soft Topological Spaces.

De-Neutrosophication Technique of Pentagonal Neutrosophic Number and Application in Minimal Spanning Tree

De-Neutrosophication Technique of Pentagonal Neutrosophic Number and Application in Minimal Spanning Tree PDF

Author: Avishek Chakraborty

Publisher: Infinite Study

Published:

Total Pages: 18

ISBN-13:

DOWNLOAD EBOOK →

In this current era, neutrosophic set theory is a crucial topic to demonstrate the ambiguous information due to existence of three disjunctive components appears in it and it provides a wide range of applications in distinct fields for the researchers. Generally, neutrosophic sets is the extended version of crisp set, fuzzy set and intuitionistic fuzzy sets to focus on the uncertain, hesitant and ambiguous datas of a real life mathematical problem.

Neutrosophic Graph Theory and Algorithms

Neutrosophic Graph Theory and Algorithms PDF

Author: Smarandache, Florentin

Publisher: IGI Global

Published: 2019-10-25

Total Pages: 406

ISBN-13: 1799813150

DOWNLOAD EBOOK →

Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory.

Lanterna Rally - Theme by Grace Themes