Two classes of non-Leech trees
<p class="p1">Let <em>T</em> be a tree of order <em>n</em>. For any edge labeling <em>f</em> : <em>E</em> → {1,2,3,...} the weight of a path <em>P</em> is the sum of the labels of the edges of <em>P</em> and is d...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2020-04-01
|
| Series: | Electronic Journal of Graph Theory and Applications |
| Subjects: | |
| Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/706 |