A proof of a conjecture on maximum Wiener index of oriented ladder graphs

DOI10.1007/s12190-021-01498-wzbMath1487.05107OpenAlexW3120966483WikidataQ122954827 ScholiaQ122954827MaRDI QIDQ2143849

Daša Štesl, Simon Špacapan, Tadeja Kraner Šumenjak

Publication date: 31 May 2022

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-021-01498-w

zbMATH Keywords

digraphCartesian productWiener index

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (2)

On maximum Wiener index of directed grids ⋮ General Randić indices of a graph and its line graph

Cites Work

• Orientations of graphs with maximum Wiener index
• Some remarks on Wiener index of oriented graphs
• The maximum Wiener index of maximal planar graphs
• A generalization of Sperner's theorem and an application to graph orientations
• Minimum average distance of strong orientations of graphs
• On the sum of all distances in a graph or digraph
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids

This page was built for publication: A proof of a conjecture on maximum Wiener index of oriented ladder graphs