Jurnal Natural
Volume 13, Number 1, March 2013

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

Al Aiyub (Multimedia Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Syiah Kuala University)
Mahyus Ihsan (Multimedia Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Syiah Kuala University)
Rahma Zuhra (Multimedia Research Group, Department of Mathematics, Faculty of Mathematics and Natural Sciences, Syiah Kuala University)

Article Info

Publish Date
02 Apr 2014

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.

Copyrights © 2013




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
444.979 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Jurnal Natural
Website

Abbrev

natural

Publisher

Universitas Syiah Kuala

Subject

Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemistry Earth & Planetary Sciences Energy Immunology & microbiology Neuroscience Physics

Description

Jurnal Natural (JN) aims to publish original research results and reviews on sciences and mathematics. Jurnal Natural (JN) encompasses a broad range of research topics in chemistry, pharmacy, biology, physics, mathematics, statistics, informatic and ...