Degree Distance of Unicyclic Graphs with Given Matching Number

作者：Feng, Lihua^*; Liu, Weijun; Ilic, Aleksandar; Yu, Guihai

来源：Graphs and Combinatorics, 2013, 29(3): 449-462.

DOI：10.1007/s00373-012-1143-5

• Degree distance
• Matching number
• Unicyclic graph
• Wiener index

Let G be a connected graph with vertex set V(G). The degree distance of G is defined as , where d (G) (u) is the degree of vertex u, d(u, v) denotes the distance between u and v, and the summation goes over all pairs of vertices in G. In this paper, we characterize n-vertex unicyclic graphs with given matching number and minimal degree distance.

• 出版日期2013-5
• 单位山东工商学院