Comparison between the Szeged index and the eccentric connectivity index
From MaRDI portal
Publication:2345599
Recommendations
- Comparison between Szeged indices of graphs
- Improved bounds on the difference between the Szeged index and the Wiener index of graphs
- Relationship between edge Szeged and edge Wiener indices of graphs
- On the difference between the Szeged and the Wiener index
- On the difference between the revised Szeged index and the Wiener index
Cites work
- A unified approach to extremal trees with respect to geometric-arithmetic, Szeged and edge Szeged indices
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- Comparing Zagreb indices and coindices of trees
- Comparison between the Wiener index and the Zagreb indices and the eccentric connectivity index for trees
- Estimating the Szeged index
- Graph theory
- scientific article; zbMATH DE number 1890136 (Why is no real title available?)
- scientific article; zbMATH DE number 2121251 (Why is no real title available?)
- scientific article; zbMATH DE number 809164 (Why is no real title available?)
- Improved bounds on the difference between the Szeged index and the Wiener index of graphs
- Maximizing the sum of the squares of the degrees of a graph
- On comparing Zagreb indices of graphs
- On comparing Zagreb indices of graphs
- On the difference between the revised Szeged index and the Wiener index
- On the differences between Szeged and Wiener indices of graphs
- On the eccentric connectivity index of a graph
- Relationship between the eccentric connectivity index and Zagreb indices
- The extremal values of the Wiener index of a tree with given degree sequence
- The relationship between the eccentric connectivity index and Zagreb indices
- The Szeged and the Wiener index of graphs
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
- Wiener index of trees: Theory and applications
- Wiener index versus Szeged index in networks
Cited in
(22)- Inequalities between degree- and distance-based graph invariants
- On the minimal eccentric connectivity indices of bipartite graphs with some given parameters
- The general Randić index of trees with given number of pendent vertices
- On the difference between the eccentric connectivity index and eccentric distance sum of graphs
- On the relation between Wiener index and eccentricity of a graph
- Comparative study of distance-based graph invariants
- Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree
- Further results on the Merrifield-Simmons index
- Comparing eccentricity-based graph invariants
- Comparative results and bounds for the eccentric-adjacency index
- On a novel eccentricity-based invariant of a graph
- On maximum Wiener index of trees and graphs with given radius
- On the Szeged index of unicyclic graphs with given diameter
- On two eccentricity-based topological indices of graphs
- Relationship between edge Szeged and edge Wiener indices of graphs
- scientific article; zbMATH DE number 1890079 (Why is no real title available?)
- Relationships between some distance-based topological indices
- Comparison between Szeged indices of graphs
- scientific article; zbMATH DE number 7415568 (Why is no real title available?)
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity
- Eccentric connectivity coindex of bipartite graphs
- On the Szeged-Sombor index of graphs
This page was built for publication: Comparison between the Szeged index and the eccentric connectivity index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345599)
