Minimum Weighted Szeged Index Trees
Combinatorics
2020-07-22 v1
Abstract
Weighted Szeged index is a recently introduced extension of the well-known Szeged index. In this paper, we present a new tool to analyze and characterize minimum weighted Szeged index trees. We exhibit the best trees with up to 81 vertices and use this information, together with our results, to propose various conjectures on the structure of minimum weighted Szeged index trees.
Keywords
Cite
@article{arxiv.2007.10510,
title = {Minimum Weighted Szeged Index Trees},
author = {Pavol Hell and César Hernández-Cruz and Seyyed Aliasghar Hosseini},
journal= {arXiv preprint arXiv:2007.10510},
year = {2020}
}