This Author published in this journals
All Journal Jurnal Natural
Al Aiyub
Multimedia Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Syiah Kuala University

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

IDENTIFY CONNECTIVITY GRAPH USING A MODIFIED PRÜFER’S ALGORITHM LABELLING TREES Al Aiyub; Mahyus Ihsan; Rahma Zuhra
Jurnal Natural Volume 13, Number 1, March 2013
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (444.979 KB)

Abstract

Connectivity of graph easily can be given when we see it with the bare of eyes, but needs an algorithm that can assure the connectivity in computerization. Some graphs require the connectivity in their definitions, such as Hamiltonian graph, Eulerian graph and tree. The connectivity become important in order to solve any of graphs' problems by using computer technology. Most of the algorithm cannot run perfectly, if the graph which is given was not connected. It is happened to Djikstra and Prufer graphs for example. However, this study will provide the solution by modifying Prufer algorithm to show the connectivity in the graph.