2000 character limit reached
Improper Graceful and Odd-graceful Labellings of Graph Theory
Published 29 Dec 2015 in cs.DM and math.CO | (1512.08634v1)
Abstract: In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having graceful/odd-graceful labellings.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.