Maximum external Wiener index of graphs
From MaRDI portal
Publication:1730256
DOI10.1016/j.dam.2018.09.024zbMath1406.05028OpenAlexW2898394800WikidataQ129035069 ScholiaQ129035069MaRDI QIDQ1730256
Darko Dimitrov, Riste Škrekovski, Barbara Ikica
Publication date: 11 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.09.024
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Wiener maximum quadratic assignment problem
- Relations between distance-based and degree-based topological indices
- The extremal values of the Wiener index of a tree with given degree sequence
- On some degree-and-distance-based graph invariants of trees
- Remarks on the Graovac-Ghorbani index of bipartite graphs
- Leapfrog fullerenes and Wiener index
- On the difference between the Szeged and the Wiener index
- Maximizing Wiener index for trees with given vertex weight and degree sequences
- Remarks on maximum atom-bond connectivity index with given graph parameters
- Wiener index, Harary index and graph properties
- On maximum Wiener index of trees and graphs with given radius
- Relationship between the edge-Wiener index and the Gutman index of a graph
- Mathematical aspects of Wiener index
- On the sum of all distances in a graph or digraph
This page was built for publication: Maximum external Wiener index of graphs