Abstract
A graph G=(V,E) is said to be (k, d)-Skolem graceful if there exists a bijection f:V(G)→{1,2,…,|V|} such that the induced edge labeling gf defined by gf(uv)=|f(u)−f(v)| is a bijection from E to {k,k+d,…,k+(q−1)d} where k and d are positive integers. Such a labeling f is called a (k, d)-Skolem graceful labeling of G. In this paper, we present a few basic results on (k, d)-Skolem graceful graphs. We prove that nK2 is (2, 1)-Skolem graceful if and only if n≡0or3(mod4), which produces the Langford sequence L(2,n).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
