Graceful Labeling of Hypertrees


  •  H. El-Zohny    
  •  S. Radwan    
  •  S.I. Abo El-Fotooh    
  •  Z. Mohammed    

Abstract

Graph labeling is considered as one of the most interesting areas in graph theory. A labeling for a simple graph G (numbering or valuation), is an association of non -negative integers to vertices of G  (vertex labeling) or to edges of G  (edge labeling) or both of them. In this paper we study the graceful labeling for the k- uniform hypertree and define a condition for the corresponding tree to be graceful. A k- uniform hypertree is graceful if the minimum difference of vertices’ labels of each edge is distinct and each one is the label of the corresponding edge.



This work is licensed under a Creative Commons Attribution 4.0 License.
  • ISSN(Print): 1916-9795
  • ISSN(Online): 1916-9809
  • Started: 2009
  • Frequency: bimonthly

Journal Metrics

  • h-index (December 2020): 21
  • i10-index (December 2020): 64
  • h5-index (December 2020): N/A
  • h5-median (December 2020): N/A

( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )

Contact