Pelabelan Skolem Graceful pada Graf Sapu

Abstract

Let G = (V,E) be a finite simple graph. Broom graph Bmn consist of (m + n) nodes is a path graph Pm with m nodes and a star graph Sn with (n + 1) nodes which are aligned at one vertex {V1}. Skolem graceful labeling is two functions with the rule that the injective function F:V → {1,2, … , |V|} which induces a bijective function g:E → {1,2, … |E|}| such that g(e) = |f(u) − f(v)|, where u, v ∈ V, and e = {u, v} ∈ E. In this research, broom graph admit skolem graceful labeling with m is odd and even.