Hidarpati , Niken (1983) Arboreslenle dalam graph. Undergraduate thesis, FMIPA UNDIP.
![[img]](/style/images/fileicons/application_pdf.png) | PDF Restricted to Repository staff only 1595Kb | |
| PDF 19Kb | |
| PDF 206Kb | |
| PDF 288Kb | |
| PDF 254Kb | |
| PDF Restricted to Repository staff only 744Kb | |
| PDF 584Kb | |
| PDF 218Kb | |
| PDF 223Kb |
Abstract
Arborescence graph adalah suatu pohon (tree) yang mempunyai sebuah akar dan tidak mempunyai cycles. Berdasar theorema dan definisi, akan dibahas bentuk matriks arborescence•juga dibahas• perhitungan banyaknya arborescence dalam graph serta dapat menentukan bobot minimal graph arborescence.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science and Mathematics > Department of Mathematics |
| ID Code: | 31326 |
| Deposited By: | Mr UPT Perpus 1 |
| Deposited On: | 18 Nov 2011 11:11 |
| Last Modified: | 18 Nov 2011 11:11 |
Repository Staff Only: item control page
