Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Irham Taufiq
Department of Mathematics, Jenderal Soedirman University
Mathematics

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

Found 2 Documents
Search

 1 
BEBERAPA SIFAT HIMPUNAN KRITIS PADA PELABELAN AJAIB GRAF BANANA TREE Triyani Triyani; Irham Taufiq
Jurnal Ilmiah Matematika dan Pendidikan Matematika Vol 4 No 2 (2012): Jurnal Ilmiah Matematika dan Pendidikan Matematika
Publisher : Jurusan Matematika FMIPA Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2012.4.2.2963

Abstract

A critical set in edge magic total labeling on graph G is a subset label such that it can forms the edge magic total labeling uniquely. This paper investigate critical set on Banana Tree graph. The result shows some properties of critical set on Banana Tree graph, such as the size of it at least , where n is number of leaf and k is number of star, except the size of critical set on graph BT(1,1) is 2. Beside it, if x is the label of any leaf and y is the label of the edge adjacent to it then each critical set in λ must contain either x or y, not both.
BEBERAPA SIFAT HIMPUNAN KRITIS PADA PELABELAN AJAIB GRAF BANANA TREE Triyani Triyani; Irham Taufiq
Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP) Vol 4 No 2 (2012): Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Publisher : Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2012.4.2.2963

Abstract

A critical set in edge magic total labeling on graph G is a subset label such that it can forms the edge magic total labeling uniquely. This paper investigate critical set on Banana Tree graph. The result shows some properties of critical set on Banana Tree graph, such as the size of it at least , where n is number of leaf and k is number of star, except the size of critical set on graph BT(1,1) is 2. Beside it, if x is the label of any leaf and y is the label of the edge adjacent to it then each critical set in λ must contain either x or y, not both.
Co-Authors Triyani Triyani