Ordering trees and connected graphs by their Wiener index
From MaRDI portal
Publication:4902252
Recommendations
Cited in
(21)- On the Wiener index of trees with given number of branching vertices
- Ordering trees by their Wiener indices
- The maximum Wiener index of maximal planar graphs
- scientific article; zbMATH DE number 6274853 (Why is no real title available?)
- Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
- Maximizing Wiener index of graphs with fixed maximum degree
- The first to \((k+1)\)-th smallest Wiener (hyper-Wiener) indices of connected graphs
- scientific article; zbMATH DE number 2185797 (Why is no real title available?)
- On the ordering of distance-based invariants of graphs
- The structure of graphs with given number of blocks and the maximum Wiener index
- Wiener index of Eulerian graphs
- Wiener indices of minuscule lattices
- Comparative results between the number of subtrees and Wiener index of graphs
- scientific article; zbMATH DE number 1890120 (Why is no real title available?)
- The extremal graphs of order trees and their topological indices
- Wiener index of graphs using degree sequence
- Ordering trees with given matching number by their Wiener indices
- Trees with the greatest Wiener and edge-Wiener index
- scientific article; zbMATH DE number 731859 (Why is no real title available?)
- On Wiener inverse interval problem of trees
- On indices of Wiener and anti-Wiener type
This page was built for publication: Ordering trees and connected graphs by their Wiener index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902252)
