Proof of a conjecture on the Wiener index of Eulerian graphs
From MaRDI portal
Publication:2032981
DOI10.1016/j.dam.2021.05.006zbMath1466.05040arXiv2101.08342OpenAlexW3165901187WikidataQ113877236 ScholiaQ113877236MaRDI QIDQ2032981
Publication date: 14 June 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.08342
Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Related Items (4)
Comparing Wiener, Szeged and revised Szeged index on cactus graphs ⋮ Wiener Index, Kirchhoff Index in Graphs with Given Girth and Maximum Degree ⋮ Extremal Wiener Index of Graphs with Given Number of Vertices of Odd Degree ⋮ Corrigendum on Wiener index, Zagreb indices and Harary index of Eulerian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Wiener maximum quadratic assignment problem
- Wiener index of Eulerian graphs
- Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
- The extremal values of the Wiener index of a tree with given degree sequence
- Wiener index versus maximum degree in trees
- Using minimum degree to bound average distance
- Maximal Wiener index for graphs with prescribed number of blocks
- The structure of graphs with given number of blocks and the maximum Wiener index
- A characterization of the non-trivial diameter two graphs of minimum size
- On the sum of all distances in a graph or digraph
- Average distance and vertex-connectivity
- Mean distance and minimum degree
- Average distance, minimum degree, and spanning trees
- Wiener index of trees: Theory and applications
This page was built for publication: Proof of a conjecture on the Wiener index of Eulerian graphs
