Abstract
A graceful labeling of a tree T with n edges is a bijection f:V(T)→{0,1,2,…,n} such that {|f(u)-f(v)|:uv∈E(T)} equal to {1,2,…,n}. A spider graph is a tree with at most one vertex of degree greater than 2. We show that all spider graphs with at most four legs of lengths greater than one admit graceful labeling.
Highlights
Labeled graphs form useful models for a wide range of disciplines and applications such as in coding theory, Xray crystallography, radar, astronomy, circuit design, and communication network addressing [1]
We show that all spider graphs with at most four legs of lengths greater than one admit graceful labeling
We prove that all spider graphs with at most four legs of lengths greater than one are graceful
Summary
Labeled graphs form useful models for a wide range of disciplines and applications such as in coding theory, Xray crystallography, radar, astronomy, circuit design, and communication network addressing [1]. A graceful labeling of a tree T with n edges is a bijection f : V(T) → {0, 1, 2, .
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
