IDENTIFY CONNECTIVITY GRAPH USING A MODIFIED PRÜFER’S ALGORITHM LABELLING TREES

IDENTIFY CONNECTIVITY GRAPH USING A MODIFIED PRÜFER’S ALGORITHM LABELLING TREES

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.

Aiyub, Al; Multimedia Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Syiah Kuala University

Ihsan, Mahyus; Multimedia Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Syiah Kuala University

Zuhra, Rahma; Multimedia Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Syiah Kuala University

Jurnal Natural; Volume 13, Number 1, Year 2013

Jurnal Natural

2014-04-02

http://jurnal.unsyiah.ac.id/natural/article/view/840/778

application/pdf

eng

info:eu-repo/semantics/article

info:eu-repo/semantics/publishedVersion

Peer-reviewed Article

http://jurnal.unsyiah.ac.id/natural/article/view/840