Comparing Wiener, Szeged and revised Szeged index on cactus graphs
Keywords:Wiener index, Szeged index, revised Szeged index, Cactus graphs
AbstractWe show that on cactus graphs the Szeged index is bounded above by twice the Wiener index. For the revised Szeged index the situation is reversed if the graph class is further restricted. Namely, if all blocks of a cactus graph are cycles, then its revised Szeged index is bounded below by twice its Wiener index. Additionally, we show that these bounds are sharp and examine the cases of equality. Along the way, we provide a formulation of the revised Szeged index as a sum over vertices, which proves very helpful, and may be interesting in other contexts.
Articles in this journal are published under Creative Commons Attribution 4.0 International License