Abstract
Let be a tree of order n and let be an injective edge labeling of T. The weight of a path P is the sum of the labels of the edges of P and is denoted by If the set of weights of the paths in T is then f is called a Leech labeling of T and a tree which admits a Leech labeling is called a Leech tree. In this paper, we present two extensions of Leech labeling to the class of all graphs, namely, Leech labeling and geodesic Leech labeling. For this purpose we introduce two parameters and where is the total number of paths in G and is the total number of geodesic paths in G. We determine the values of these parameters for some graph classes. We present several families of graphs which are Leech graphs, geodesic Leech graphs and also graphs which are not Leech graphs. A list of open problems is also included.
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 callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: 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.
