Title of article
Leech Graphs
Author/Authors
Varghese ، Seena Department of Mathematics - Federal Institute of Science and Technology , Savithri ، Aparna Department of Mathematics - Cochin University of Science and Technology , Arumugam ، S. National Centre for Advanced Research in Discrete Mathematics - Kalasalingam University Anand Nagar
From page
205
To page
215
Abstract
Let tp(G) denote the number of paths in a graph G and let f : E ! Z^+ be an edge labeling of G. The weight of a path P is the sum of the labels assigned to the edges of P. If the set of weights of the paths in G is f1; 2; 3; : : : ; tp(G)g, then f is called a Leech labeling of G and a graph which admits a Leech labeling is called a Leech graph. In this paper, we prove that the complete bipartite graphs K2;n and K3;n are not Leech graphs and determine the maximum possible value that can be given to an edge in the Leech labeling of a cycle.
Keywords
Leech labeling , Leech tree , Leech graph
Journal title
Communications in Combinatorics and Optimization
Journal title
Communications in Combinatorics and Optimization
Record number
2762211
Link To Document