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

London Journal of Research in Science: Natural and Formal
Volume | Issue | Compilation
Classification: NA
Keywords: Minimal spanning tree, Prim’s algorithm, Kruskal’s algorithm and bipolar neutrosophic weighted edges.
Language: English

The minimal spanning tree (MST) algorithms by using the edges weights are elderly 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 we angry with the new model algorithms namely bipolar neutrosophic Prim’s algorithm and bipolar neutrosophic Kruskal’s algorithm. Further, we use the score functions we get the satisfied results based on the algorithms.


Moved Temporarily

The document has moved here.


For Authors

Author Membership provide access to scientific innovation, next generation tools, access to conferences/seminars
/symposiums/webinars, networking opportunities, and privileged benefits.
Authors may submit research manuscript or paper without being an existing member of LJP. Once a non-member author submits a research paper he/she becomes a part of "Provisional Author Membership".

Know more


For Institutions

Society flourish when two institutions come together." Organizations, research institutes, and universities can join LJP Subscription membership or privileged "Fellow Membership" membership facilitating researchers to publish their work with us, become peer reviewers and join us on Advisory Board.

Know more


For Subscribers

Subscribe to distinguished STM (scientific, technical, and medical) publisher. Subscription membership is available for individuals universities and institutions (print & online). Subscribers can access journals from our libraries, published in different formats like Printed Hardcopy, Interactive PDFs, EPUBs, eBooks, indexable documents and the author managed dynamic live web page articles, LaTeX, PDFs etc.

Know more