SOME NEW FAMILY OF GRACEFUL LOBSTERS
The lobsters with central paths to which we give graceful labelings satisfy the following properties:
(i) The vertex may be attached to one among the combinations and
(ii) The path can be partitioned into subpaths with the following properties:
(a) consists of at most four vertices.
(b) Each vertex in is attached to an odd (or even) number of branches. If each vertex in is attached to an odd number of branches, then the length of is 4.
graceful labeling, lobster, odd and even branches, component moving transformation.