On the strength of some trees
Open Access
- 21 June 2019
- journal article
- research article
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 17 (1) , 486-494
Abstract
Let be a graph of order . A numbering of is a labeling that assigns distinct elements of the set to the vertices of , where each edge of is labeled . The strength str of a numbering of is defined by that is, is the maximum edge label of , and the strength str of a graph itself is The strengths and are determined for caterpillars and -level complete -ary trees . The strength is also given for graphs obtained by taking the corona of certain graphs and an arbitrary number of isolated vertices. The work of this paper suggests an open problem on the strength of trees.
Keywords
This publication has 6 references indexed in Scilit:
- Graceful, Harmonious and Magic Type Labelings2017
- The place of super edge-magic labelings among other classes of labelingsDiscrete Mathematics, 2001
- SUPER EDGE-MAGIC GRAPHSSUT Journal of Mathematics, 1998
- Strongly indexable graphsDiscrete Mathematics, 1991
- Magic Valuations of Finite GraphsCanadian Mathematical Bulletin, 1970
- On the corona of two graphsAequationes mathematicae, 1970