Extremal properties of distance-based graph invariants for $k$-trees
Sharp bounds on some distance-based graph invariants of $n$-vertex $k$-trees are established in a unified approach, which may be viewed as the weighted Wiener index or weighted Harary index. The main techniques used in this paper are graph transformations and mathematical induction. Our results demo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics of the Czech Academy of Science
2018-04-01
|
| Series: | Mathematica Bohemica |
| Subjects: | |
| Online Access: | http://mb.math.cas.cz/full/143/1/mb143_1_4.pdf |