|
|
|
(18.189.180.244)
|
|
Users online: 9603
|
|
|
|
|
|
|
Ijournet
|
|
|
|
|
|
|
Minimum Spanning Tree on World Famous Seven Statues with Prim’s and Kruskal Algorithm using Neutrosophic Fuzzy Graphs Divya R.* Assistant Professor, PG and Research Department of Mathematics, Cauvery College for Women (Autonomous), Tiruchirappalli, Affiliated to Bharathidasan University, Trichy-18, Tamil Nadu, India *E-mail : rdivyamat@gmail.com
Online Published on 12 December, 2023. Abstract The concept of this research is introduced to minimum spanning tree with prim's and Kruskal algorithm using neutrosophic fuzzy graph which is combined real world famous seven statues shortest path problem. In this analysis, proposed algorithm finds source node and destination node because of the shortest path problem. In this research, we apply minimum spanning tree prim's and Kruskal algorithm neutrosophic fuzzy graph and finding their score function. Finally we conclude famous seven statues shortest path problem. Top Keywords Neutrosophic fuzzy graph (NFG), Minimal spanning tree under neutrosophic fuzzy graph (MSTUNFG). Top | |
|
|
|
|
║ Site map
║
Privacy Policy ║ Copyright ║ Terms & Conditions ║
|
|
|
743,932,680 visitor(s) since 30th May, 2005.
|
|
All rights reserved. Site designed and maintained by DIVA ENTERPRISES PVT. LTD..
|
|
Note: Please use Internet Explorer (6.0 or above). Some functionalities may not work in other browsers.
|