The Wiener index of hypergraphs
- 38 Downloads
The Wiener index is defined to be the sum of distances between every unordered pair of vertices in a connected hypergraph. In this paper, we first study how the Wiener index of a hypergraph changes under some graft transformations. For \(1\le m\le n-1\), we obtain the unique hypertree that achieves the minimum (or maximum) Wiener index in the class of hypertrees on n vertices and m edges. Then we characterize the unique hypertrees on n vertices with first three smallest Wiener indices, and the unique hypertree (not 2-uniform) with maximum Wiener index, respectively. In addition, we determine the unique hypergraph that achieves the minimum Wiener index in the class of hypergraphs on n vertices and p pendant edges.
KeywordsHypergraph Hypertree Wiener index
Mathematics Subject Classification05C50 05C65
- Gutman I, Yeh YN, Lee SL, Luo YL (1993) Some recent results in the theory of the Wiener number. Indian J Chem 32A:651–661Google Scholar