Skolem Graceful Labelin on Broom Graph
Year: 2024
Type: article
Abstract: Let G=(V,E) be a finite simple graph. Broom graph B_(m,n) consist of (m+n) nodes is a path graph P_m with m nodes and a star graph S_n with (n+1) nodes, which are aligned at 1 vertex is the endpoint of the path graph and the center point of the star graph. 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.
Authors: Saib Suwilo, Kristin Lamria
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4412426467