Pages that link to "Item:Q765351"
From MaRDI portal
The following pages link to Further results on the eccentric distance sum (Q765351):
Displaying 32 items.
- On the extreme eccentric distance sum of graphs with some given parameters (Q277627) (← links)
- On eccentric distance sum and minimum degree (Q401135) (← links)
- Some extremal results on the connective eccentricity index of graphs (Q499166) (← links)
- On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum (Q512546) (← links)
- On the extremal values of the eccentric distance sum of trees with a given maximum degree (Q777408) (← links)
- Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs (Q1671325) (← links)
- Extremal values on Zagreb indices of trees with given distance \(k\)-domination number (Q1691326) (← links)
- Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index (Q1720330) (← links)
- Some further results on the eccentric distance sum (Q1799765) (← links)
- On eccentric distance sum and degree distance of graphs (Q1801067) (← links)
- Eccentric adjacency index of graphs with a given number of cut edges (Q1988564) (← links)
- On the extremal values of the eccentric distance sum of trees with a given domination number (Q2012062) (← links)
- On some bounds and exact formulae for connective eccentric indices of graphs under some graph operations (Q2019272) (← links)
- Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum (Q2020461) (← links)
- Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree (Q2078836) (← 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)
- On the maximum value of the eccentric distance sums of cubic transitive graphs (Q2279418) (← links)
- On the minimum eccentric distance sum of bipartite graphs with some given parameters (Q2352882) (← links)
- On a novel eccentricity-based invariant of a graph (Q2396735) (← links)
- Extremal values on the eccentric distance sum of trees (Q2444535) (← links)
- Computing the eccentric-distance sum for graph operations (Q2446873) (← links)
- The irregularity of some composite graphs (Q2657572) (← links)
- First reformulated Zagreb indices of some classes of graphs (Q4634957) (← links)
- ASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORK (Q4959951) (← links)
- Inverse Connective Eccentricity Index and its Applications (Q5077729) (← links)
- On extremal bipartite graphs with given number of cut edges (Q5854744) (← links)
- The minimum eccentric distance sum of trees with given distance k-domination number (Q5858160) (← links)
- On the extremal values of the eccentric distance sum of trees (Q5919748) (← links)
- On the eccentric distance sum of trees with given maximum degree (Q6204297) (← links)
- Some sufficient conditions for graphs to be \(k\)-leaf-connected (Q6497937) (← links)
- On the eccentric connectivity index of trees with given domination number (Q6648292) (← links)
