Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Jurnal Riset Mahasiswa Matematika
Achmad Nasichuddin
Universitas Islam Negeri Maulana Malik Ibrahim Malang, Indonesia
Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
DEKOMPOSISI GRAF POHON PISANG Bm,n Alfi Istijap Aji Sailendra; Evawati Alisah; Achmad Nasichuddin
Jurnal Riset Mahasiswa Matematika Vol 2, No 1 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (329.815 KB) | DOI: 10.18860/jrmm.v2i1.14671

Abstract

A decomposition of graph G is collection of subgraphs 〖{H_i}〗_(i=1)^n from G such that H_i [E_i] for E_i is a subset of E(G) and 〖{E_i}〗_(i=1)^n is a partition of E(G). The purpose of the research was to determine the decomposition of the banana tree graph B_(m,n), for m≥1 and n≥2. The research method used in this research is library research. The steps used to determine the decomposition of the banana tree graph B_(m,n) are as follow: (a) Draw a banana tree graph B_(m,n) and label each edge and vertex, (b) Determine the partition on the edges of the banana tree graph B_(m,n), (c) Induced subgraph of from partitions of the banana tree graph B_(m,n), (d) Determine the decomposition of the banana tree graph B_(m,n), (e) Tabulate a conjecture on the decomposition of the banana tree graph B_(m,n), (f) Construct theorem of the decomposition theorem of of the banana tree graph B_(m,n) and its proof. The result of the reasearch is with m≥1 and n≥2, because banana tree graph B_(m,n) is decomposed by the complete graph 〖mK〗_2-decomposition.
Co-Authors Alfi Istijap Aji Sailendra Evawati Alisah