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...

全面介紹

書目詳細資料

發表在:	Fokus
主要作者:	Novia Rahmawati
格式:	Article
語言:	印度尼西亚语
出版:	Institut Agama Islam Negeri (IAIN) Curup 2016-12-01
主題:	complete bipartite graph the matrix-tree theorem cofactor spanning tree
在線閱讀:	https://journal.iaincurup.ac.id/index.php/JF/article/view/66