BEBERAPA SIFAT HIMPUNAN KRITIS PADA PELABELAN AJAIB GRAF BANANA TREE

  • Triyani Triyani Department of Mathematics, Jenderal Soedirman University
  • Irham Taufiq Department of Mathematics, Jenderal Soedirman University

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.

Published
2012-12-28
How to Cite
TRIYANI, Triyani; TAUFIQ, Irham. BEBERAPA SIFAT HIMPUNAN KRITIS PADA PELABELAN AJAIB GRAF BANANA TREE. Jurnal Ilmiah Matematika dan Pendidikan Matematika, [S.l.], v. 4, n. 2, p. 271 - 278, dec. 2012. ISSN 2550-0422. Available at: <http://jos.unsoed.ac.id/index.php/jmp/article/view/2963>. Date accessed: 04 feb. 2023. doi: https://doi.org/10.20884/1.jmp.2012.4.2.2963.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.