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 (). 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 . Finding a tree with the minimal 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 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 attains the maximal ,. We believe that the is a connected graph of given order that attains the maximum .
Recommendations
Cited in
(7)- On graphs preserving PI index upon edge removal
- scientific article; zbMATH DE number 1548995 (Why is no real title available?)
- On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index
- scientific article; zbMATH DE number 7103374 (Why is no real title available?)
- On Mostar index of trees with parameters
- Trees with minimum weighted Szeged index
- Szeged index, edge Szeged index, and semi-star trees
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)