|
|
|
|
leech graphs
|
|
|
|
|
|
|
|
نویسنده
|
varghese seena ,savithri aparna ,arumugam s.
|
|
منبع
|
communications in combinatorics and optimization - 2024 - دوره : 9 - شماره : 2 - صفحه:205 -215
|
|
چکیده
|
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 tothe edges of p. if the set of weights of the paths in g is f1; 2; 3; : : : ; tp(g)g, then f iscalled a leech labeling of g and a graph which admits a leech labeling is called a leechgraph. in this paper, we prove that the complete bipartite graphs k2;n and k3;n arenot leech graphs and determine the maximum possible value that can be given to anedge in the leech labeling of a cycle.
|
|
کلیدواژه
|
leech labeling ,leech tree ,leech graph
|
|
آدرس
|
federal institute of science and technology, department of mathematics, india, cochin university of science and technology, department of mathematics, india, kalasalingam universityanand nagar, national centre for advanced research in discrete mathematics, india
|
|
پست الکترونیکی
|
s.arumugam.klu@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|