Pages that link to "Item:Q2345599"
From MaRDI portal
The following pages link to Comparison between the Szeged index and the eccentric connectivity index (Q2345599):
Displaying 18 items.
- Inequalities between degree- and distance-based graph invariants (Q1697635) (← links)
- On the minimal eccentric connectivity indices of bipartite graphs with some given parameters (Q1732118) (← links)
- The general Randić index of trees with given number of pendent vertices (Q1735285) (← links)
- On the difference between the eccentric connectivity index and eccentric distance sum of graphs (Q2021686) (← links)
- On the relation between Wiener index and eccentricity of a graph (Q2045025) (← links)
- Comparative study of distance-based graph invariants (Q2053092) (← links)
- Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree (Q2078836) (← links)
- Further results on the Merrifield-Simmons index (Q2192080) (← links)
- Comparing eccentricity-based graph invariants (Q2194535) (← links)
- Comparative results and bounds for the eccentric-adjacency index (Q2197419) (← links)
- On a novel eccentricity-based invariant of a graph (Q2396735) (← links)
- On maximum Wiener index of trees and graphs with given radius (Q2410106) (← links)
- On the Szeged index of unicyclic graphs with given diameter (Q2410256) (← links)
- On two eccentricity-based topological indices of graphs (Q2410268) (← links)
- Relationships between some distance-based topological indices (Q5086798) (← links)
- Comparison between Szeged indices of graphs (Q5129752) (← links)
- (Q5159526) (← links)
- Eccentric connectivity coindex of bipartite graphs (Q6174133) (← links)
