Dwi Aruma Urnika, P. Purwanto
Let G be a finite simple graph with vertex set V(G) and edge set (G). A skolem graceful labeling of G is an injective function f: V(G) {1, 2, 3, .., V(G)} such that the induced labeling f': E(G) {1, 2, 3, .., E(G) } defined by f'(uv) = f(u) - f(v), for every uv E(G), is bijection. A graph that admits a skolem graceful labeling is said to be skolem graceful. Many authors have study skolem graceful labeling of some graphs. In this paper we study skolem graceful labeling of lobster Ln(2,r). We find that lobster graph Ln(2,r) is skolem graceful. The lobster graph Ln(2,r) is a graph formed from a path on n vertex as a backbone, each vertex in the backbone is joined to two different vertex hands, and each vertex hand is joined to r different vertex fingers each of which has degree one. © 2021 Author(s).
Department of Mathematics, Universitas Negeri Malang, Jalan Semarang 5, Malang, 65145, Indonesia
Research at a Glance
Register to unlock
Topics & SDG Alignment
Register to unlock
Collaboration
Register to unlock
Author Profile (Selected)
Register to unlock
References Overview
Register to unlock
Journal & Source
Register to unlock
Metadata & Integrity
Register to unlock