Pages that link to "Item:Q4899904"
From MaRDI portal
The following pages link to The Maximum Wiener Index of Trees with Given Degree Sequences (Q4899904):
Displaying 38 items.
- On the maximal Wiener index and related questions (Q427906) (← links)
- Q-Wiener index of some compound trees (Q440912) (← links)
- The minimal number of subtrees of a tree (Q489363) (← links)
- The minimal number of subtrees with a given degree sequence (Q489367) (← links)
- Ordering trees with given matching number by their Wiener indices (Q499995) (← links)
- The largest Wiener index of unicyclic graphs given girth or maximum degree (Q513505) (← links)
- On the variable Wiener indices of trees with given maximum degree (Q623069) (← links)
- The distances between internal vertices and leaves of a tree (Q740265) (← links)
- On the edge-Szeged index of unicyclic graphs with perfect matchings (Q777383) (← links)
- On the eccentric subtree number in trees (Q827611) (← links)
- Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence (Q967447) (← links)
- Peripheral Wiener index of trees and related questions (Q1627854) (← links)
- The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices (Q1677116) (← links)
- On the sum of the squares of all distances in bipartite graphs with given connectivity (Q1706137) (← links)
- Sum of weighted distances in trees (Q1730222) (← links)
- Note on extremal graphs with given matching number (Q1738091) (← links)
- On extremal cacti with respect to the Szeged index (Q1738101) (← links)
- Wiener index of iterated line graphs of trees homeomorphic to \(H\) (Q1945956) (← links)
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees (Q1999724) (← links)
- The Steiner Wiener index of trees with a given segment sequence (Q2008355) (← links)
- Graphs with a given diameter that maximise the Wiener index (Q2009565) (← links)
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost (Q2032849) (← links)
- Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity (Q2096310) (← links)
- Extreme Wiener indices of trees with given number of vertices of maximum degree (Q2231742) (← links)
- The number of subtrees in graphs with given number of cut edges (Q2231772) (← links)
- Some extremal ratios of the distance and subtree problems in binary trees (Q2279596) (← links)
- Extremal cover cost and reverse cover cost of trees with given segment sequence (Q2297740) (← links)
- On distances in vertex-weighted trees (Q2335160) (← links)
- On extremal cacti with respect to the revised Szeged index (Q2410267) (← links)
- On the sum of all distances in bipartite graphs (Q2449069) (← links)
- Complete solution of equation \(W(L^3(T))=W(T)\) for the Wiener index of iterated line graphs of trees (Q2449110) (← links)
- (Q3643759) (← links)
- On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index (Q5083160) (← links)
- (Q5157502) (← links)
- Extremal trees with respect to the Steiner Wiener index (Q5207501) (← links)
- (Q5279992) (← links)
- The Number of Subtrees of Trees with Given Degree Sequence (Q5325940) (← links)
- A survey of recent extremal results on the Wiener index of trees (Q6562215) (← links)
