Contents

Ars Combinatoria

  • Research article

The Hyper-Wiener Index of Unicyclic Graphs with Given Matching Number

Lihua Feng1,2
1Department of Mathematics, Shandong Institute of Business and Technology 191 Binhaizhong Road, Yantai, Shandong, P.R. China, 264005.
2Department of Mathematics, Central South University Railway Campus, Changsha, Hunan, P.R. China, 410075.
  • Published: 31/07/2011

Abstract

Let \(G\) be a connected simple graph. The hyper-Wiener index \(WW(G)\) is defined as \(WW(G) = \sum_{u,v \in V(G)} (d(u, v) + d^2(u,v)),\) with the summation going over all pairs of vertices in \(G\). In this paper, we determine the extremal unicyclic graphs with given matching number and minimal hyper-Wiener index.

Citation
Lihua Feng. The Hyper-Wiener Index of Unicyclic Graphs with Given Matching Number[J], Ars Combinatoria, Volume 100. 9-17. .