Pages that link to "Item:Q1720330"
From MaRDI portal
The following pages link to Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index (Q1720330):
Displaying 19 items.
- On the extreme eccentric distance sum of graphs with some given parameters (Q277627) (← links)
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants (Q777368) (← links)
- General eccentric connectivity index of trees and unicyclic graphs (Q777397) (← links)
- On the general degree-eccentricity index of a graph (Q821265) (← links)
- Comparing Wiener complexity with eccentric complexity (Q827592) (← links)
- Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs (Q1671325) (← links)
- On the minimal eccentric connectivity indices of bipartite graphs with some given parameters (Q1732118) (← links)
- On the difference between the eccentric connectivity index and eccentric distance sum of graphs (Q2021686) (← links)
- On graphs with maximum average eccentricity (Q2032986) (← links)
- Relations between degree-based graph invariants (Q2112651) (← links)
- Extremal graphs with respect to two distance-based topological indices (Q2142688) (← links)
- Comparing eccentricity-based graph invariants (Q2194535) (← links)
- On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2 (Q2197435) (← links)
- Maximum eccentric connectivity index for graphs with given diameter (Q2274082) (← links)
- On the maximum value of the eccentric distance sums of cubic transitive graphs (Q2279418) (← links)
- On the extremal eccentric connectivity index of graphs (Q2333162) (← links)
- The eccentric distance sum, the Harary index and the degree powers of graphs with given diameter. (Q2828997) (← links)
- The eccentric distance sum of connected graphs (Q2831570) (← links)
- Some sufficient conditions for graphs to be \(k\)-leaf-connected (Q6497937) (← links)
