Abstract
Extensions of the definition of a ( k)-graceful numbering of a finite graph are presented for countably infinite graphs. Sufficient conditions for existence of such numberings are presented. and, in particular, the class of countably infinite trees is examined in detail. It is shown that all countably infinite tress are k-graceful, but not necessarily ‘ bijectively’-k- graceful . Some number theoretic questions, like those of M. Hall and R. Entringer involving various difference sets obtained from the set of natural numbers, are seen to be particular instances of the problem of gracefully labelling a countably infinite graph.
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.
