Trees with the Greatest Wiener and Edge-Wiener Index
Ali Ghalavand
Abstract
Ali Ghalavand
Abstract
The Wiener index W and the edge-Wiener index W_e of G are defined as the sum of distances between all pairs of vertices in G and the sum of distances between all pairs of edges in G, respectively. In this paper, we identify the four trees, with the first through fourth greatest Wiener and edge-Wiener index among all trees of order n ≥ 10.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The Wiener index W and the edge-Wiener index W_e of G are defined as the sum of distances between all pairs of vertices in G and the sum of distances between all pairs of edges in G, respectively. In this paper, we identify the four trees, with the first through fourth greatest Wiener and edge-Wiener index among all trees of order n ≥ 10.
Key concepts: Wiener index, Mathematics, Index (typography), Combinatorics, Enhanced Data Rates for GSM Evolution, Topological index, Graph, Computer science