Skip to main
Zenodo home
Communities
My dashboard
Log in Sign up
Published April 24, 2025 | Version v1
Journal article Open

Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs

Authors/Creators

  • Sukanta Ghadei
  • Amaresh Chandra Panada
  • Surapati Pramanik
  • Nihar Ranjan Panda
  • Prasanta Kumar Raut

Files

21MinimumSpanning.pdf

Files (641.6 kB)

Name Size
21MinimumSpanning.pdf
md5:5d163e79c66e0c964e49e4c614ebd29a
641.6 kB Preview Download
116
Views
72
Downloads
Show more details
All versions This version
Views

Total views

116 116
Downloads

Total downloads

72 72
Data volume

Total data volume

47.5 MB 47.5 MB

More info on how stats are collected....

Versions

External resources

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.15272504
DOI Badge

DOI

10.5281/zenodo.15272504

Markdown

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.15272504.svg)](https://doi.org/10.5281/zenodo.15272504)

reStructuredText

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.15272504.svg
  :target: https://doi.org/10.5281/zenodo.15272504

HTML

<a href="https://doi.org/10.5281/zenodo.15272504"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.15272504.svg" alt="DOI"></a>

Image URL

https://zenodo.org/badge/DOI/10.5281/zenodo.15272504.svg

Target URL

https://doi.org/10.5281/zenodo.15272504
Resource type
Journal article
Publisher
Zenodo

Rights

License
cc-by-4.0 icon Creative Commons Attribution 4.0 International
The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited. Read more

Citation

Export

Technical metadata

Created
April 23, 2025
Modified
April 23, 2025

About

  • About
  • Policies
  • Infrastructure
  • Principles
  • Projects
  • Roadmap
  • Contact

Blog

  • Blog

Support

  • Help
  • FAQ

Developers

  • REST API
  • OAI-PMH

Contribute

  • GitHub
  • Donate

Funded by

Powered by CERN Data Centre & InvenioRDM

  • Status
  • Privacy policy
  • Cookie policy
  • Terms of Use

This site uses cookies. Find out more on how we use cookies