Teorema Pohon Matriks Untuk Menentukan Banyaknya Pohon Rentangan Graf Bipartisi Komplit (Km,n)
DOI:
https://doi.org/10.29240/jf.v1i1.66Keywords:
complete bipartite graph, the matrix-tree theorem, cofactor, spanning treeAbstract
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 complete bipartite graph (Km,n); (3)Observing the different between degree matrix and adjacency matrix (laplacian matrix) from complete bipartite graph (Km,n); (4)Observing cofactor value of laplacian matrix from complete bipartite graph (Km,n); (5)Observing spanning tree number pattern from complete bipartite graph (Km,n); (6)Forming the formula within theorem; (7)Proving the theorem. The results of this research are as follows that the general form spanning tree number incomplete bipartite graph(Km,n) with m=1,2,3,4, n 1 and m, n ∈N where is:
Ï„(Km,n) = m^(n-1).n^(m-1)
Downloads
Download data is not yet available.
Downloads
Published
2016-12-16
Issue
Section
Articles
Citation Check
License
Authors who publish with FOKUS: Jurnal Kajian Keislaman dan Kemasyarakatan agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC BY-NC-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).