Ordering trees and connected graphs by their Wiener index
From MaRDI portal
Publication:4902252
zbMATH Open1265.05104MaRDI QIDQ4902252FDOQ4902252
Authors: Ruxandra Verman
Publication date: 14 January 2013
Recommendations
Cited In (21)
- Title not available (Why is that?)
- Wiener index of graphs using degree sequence
- Title not available (Why is that?)
- The maximum Wiener index of maximal planar graphs
- Comparative results between the number of subtrees and Wiener index of graphs
- Title not available (Why is that?)
- Maximizing Wiener index of graphs with fixed maximum degree
- The extremal graphs of order trees and their topological indices
- Wiener index of Eulerian graphs
- Trees with the greatest Wiener and edge-Wiener index
- On the ordering of distance-based invariants of graphs
- On the Wiener index of trees with given number of branching vertices
- On indices of Wiener and anti-Wiener type
- The structure of graphs with given number of blocks and the maximum Wiener index
- Wiener indices of minuscule lattices
- Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
- Title not available (Why is that?)
- The first to \((k+1)\)-th smallest Wiener (hyper-Wiener) indices of connected graphs
- Ordering trees with given matching number by their Wiener indices
- On Wiener inverse interval problem of trees
- Ordering trees by their Wiener indices
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)