SPANNING TREE AND MINIMUM SPANNING TREE

George Delfiya L , Dr.A. Arockia Lancy

In this paper, we have given the mathematical properties of spanning tree and the Kirchhoff’s matrix tree theorem to find the total number of possible spanning trees. And also the properties of minimum spanning tree, kruskal’s method and prim’s method to find the minimum spanning tree. In this paper the total number of possible spanning trees are derived for cycle ,wheel and complete graph with five and six vertices.

Published Paper   E-Certificate

"SPANNING TREE AND MINIMUM SPANNING TREE", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.4, Issue 3, page no.146 - 150, March-2019, Available :https://ijsdr.org/papers/IJSDR1903026.pdf

Volume 4 Issue 3, March-2019

Pages : 146 - 150

Paper Reg. ID: IJSDR_190159

Published Paper Id: IJSDR1903026

Downloads: 000347200

Research Area: Applied Mathematics

Country: Sivagangai, Tamilnadu, India

Published Paper PDF: https://ijsdr.org/papers/IJSDR1903026

Published Paper URL: https://ijsdr.org/viewpaperforall?paper=IJSDR1903026

ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Publisher: IJSDR(IJ Publication) Janvi Wave

This work is licensed under a Creative Commons Attribution 4.0 International License and The Open Definition