Teorema Pohon Matriks Untuk Menentukan Banyaknya Pohon Rentangan Graf Bipartisi Komplit (Km,n)
This research aims to observes panning tree number of complete bipartite graph (Km,n) by matrix-tree theorem.This research was using library research method which the step are:(1)Drawing complete bipartite graph (Km,n) where m= 1,2,3,4,and; (2)Determinin adjacency matrix and degree matrix of complet...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Indonesian |
| Published: |
Institut Agama Islam Negeri (IAIN) Curup
2016-12-01
|
| Series: | Fokus |
| Subjects: | |
| Online Access: | https://journal.iaincurup.ac.id/index.php/JF/article/view/66 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|