On extremal graphs of weighted Szeged index

From MaRDI portal
Publication:5159173



Abstract: An extension of the well-known Szeged index was introduced recently, named as weighted Szeged index (extrmsz(G)). This paper is devoted to characterizing the extremal trees and graphs of this new topological invariant. In particular, we proved that the star is a tree having the maximal extrmsz(G). Finding a tree with the minimal extrmsz(G) is not an easy task to be done. Here, we present the minimal trees up to 25 vertices obtained by computer and describe the regularities which retain in them. Our preliminary computer tests suggest that a tree with the minimal extrmsz(G) is also the connected graph of the given order that attains the minimal weighted Szeged index. Additionally, it is proven that among the bipartite connected graphs the complete balanced bipartite graph Kleftlfloorn/2ightfloorleftlceiln/2ightceil attains the maximal extrmsz(G),. We believe that the Kleftlfloorn/2ightfloorleftlceiln/2ightceil is a connected graph of given order that attains the maximum extrmsz(G).












This page was built for publication: On extremal graphs of weighted Szeged index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159173)