2011•Unpublished venueRequires access

The Wiener Index of Trees with Prescribed Diameter

Gaixiang Cai

Abstract

The Wiener index W(G) of a graph G is defined as the sum of d_G(u,v) over all pairs of vertices,where d_g(u,v) is the distance between vertices u and v in G.In this paper,we characterize the tree with third-minimum Wiener index and introduce the method of obtaining the order of the Wiener indices among all the trees with given order and diameter,respectively.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Wiener index, Mathematics, Combinatorics, Index (typography), Graph, Tree (set theory), Connectivity, Order (exchange)