Digraphs with large maximum Wiener index
From MaRDI portal
Publication:1733463
DOI10.1016/j.amc.2016.03.007zbMath1410.05079OpenAlexW2333516745MaRDI QIDQ1733463
Riste Škrekovski, Martin Knor, Aleksandra Tepeh Horvat
Publication date: 21 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2016.03.007
Related Items (9)
On maximum Wiener index of directed grids ⋮ Peripheral Wiener index of trees and related questions ⋮ On investigations of graphs preserving the Wiener index upon vertex removal ⋮ Counterexamples to the conjecture on orientations of graphs with minimum Wiener index ⋮ Spectral norm of oriented graphs ⋮ General Randić indices of a graph and its line graph ⋮ On the Wiener index of orientations of graphs ⋮ A lower bound of revised Szeged index of bicyclic graphs ⋮ An inequality between variable Wiener index and variable Szeged index
Cites Work
- A history of graph entropy measures
- Some remarks on Wiener index of oriented graphs
- An inequality between the edge-Wiener index and the Wiener index of a graph
- Graph distance measures based on topological indices revisited
- Mean distance in a graph
- Novel inequalities for generalized graph entropies -- graph energies and topological indices
- Degree-based entropies of networks revisited
- Minimum average distance of strong orientations of graphs
- On the total distance between nodes in tournaments
- Mathematical aspects of Wiener index
- On the sum of all distances in a graph or digraph
- Wiener index of trees: Theory and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Digraphs with large maximum Wiener index