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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Syiah Kuala, Faculty of Mathematics and Natural Science
2014-04-01
|
| Series: | Jurnal Natural |
| Online Access: | http://jurnal.unsyiah.ac.id/natural/article/view/840 |