An asymptotic resolution of a problem of Plesník

DOI10.1016/j.jctb.2020.06.003zbMath1448.05085arXiv1811.08334OpenAlexW3036892734MaRDI QIDQ2200927

Stijn Cambie

Publication date: 24 September 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.08334

zbMATH Keywords

diameterdigraphsextremal problemsWiener indexaverage distance

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (5)

Maximum size of digraphs of given radius ⋮ The extremal average distance of cubic graphs ⋮ Kemeny's constant and Wiener index on trees ⋮ Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence ⋮ Proof of a conjecture on Wiener index and eccentricity of a graph due to edge contraction

Cites Work

• Spanning trees with many leaves and average distance
• On the sum of all distances in a graph or digraph
• The Average Distance in a Random Graph with Given Expected Degrees
• WIENER INDEX OF TREES OF GIVEN ORDER AND DIAMETER AT MOST
• Diameters in graphs

This page was built for publication: An asymptotic resolution of a problem of Plesník