On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index
From MaRDI portal
Publication:5083160
Abstract: The edge Szeged index and edge-vertex Szeged index of a graph are defined as and respectively, where (resp., ) is the number of edges whose distance to vertex (resp., ) is smaller than the distance to vertex (resp., ), and (resp., ) is the number of vertices whose distance to vertex (resp., ) is smaller than the distance to vertex (resp., ), respectively. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, the lower bounds of edge Szeged index and edge-vertex Szeged index for cacti with order and cycles are determined, and all the graphs that achieve the lower bounds are identified.
Recommendations
- On extremal cacti with respect to the Szeged index
- On extremal cacti with respect to the revised Szeged index
- Cactus graphs with minimum edge revised Szeged index
- scientific article; zbMATH DE number 1548995
- On extremal graphs of weighted Szeged index
- Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
- On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles
- On the revised edge-Szeged index of graphs
- Note on the graphs with the greatest edge-Szeged index
- Computation of edge PI index, vertex PI index and Szeged index of some cactus chains
Cites work
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 1890134 (Why is no real title available?)
- scientific article; zbMATH DE number 6116805 (Why is no real title available?)
- A matrix method for computing Szeged and vertex PI indices of join and composition of graphs
- Bicyclic graphs with maximal revised Szeged index
- Bounds for the sum-Balaban index and (revised) Szeged index of regular graphs
- Computing Szeged index of certain nanosheets using partition technique
- Edge Szeged index of unicyclic graphs
- L-fuzzy sets
- Maximum Wiener index of trees with given degree sequence
- On Szeged indices of unicyclic graphs
- On a conjecture about the Szeged index
- On extremal cacti with respect to the Szeged index
- On the distance Laplacian spectral radius of graphs
- On the further relation between the (revised) Szeged index and the Wiener index of graphs
- Revised and edge revised Szeged indices of graphs
- Separability properties of almost-disjoint families of sets
- The (revised) Szeged index and the Wiener index of a nonbipartite graph
- The trees on \(n\geq 9\) vertices with the first to seventeenth greatest Wiener indices are chemical trees
- Vertex and edge PI indices of Cartesian product graphs
- Wiener index of trees: Theory and applications
Cited in
(10)- Computation of edge PI index, vertex PI index and Szeged index of some cactus chains
- scientific article; zbMATH DE number 7410894 (Why is no real title available?)
- Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
- Cactus graphs with minimum edge revised Szeged index
- On the edge-Szeged index of unicyclic graphs with perfect matchings
- On cacti with large Mostar index
- On the sharp bounds of bicyclic graphs regarding edge Szeged index
- On extremal cacti with respect to the revised Szeged index
- On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles
- On extremal cacti with respect to the Szeged index
This page was built for publication: On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5083160)