|
|||||
|
|
Degree Distance of Unicyclic Graphs with Given Matching Number |
|
| Authors: | Lihua Feng Weijun Liu Aleksandar Ili? Guihai Yu |
| Institution: | 1. Department of Mathematics, Shandong Institute of Business and Technology, Yantai, Shandong, People’s Republic of China 2. Department of Mathematics, Central South University, Changsha, 410075, People’s Republic of China 3. Faculty of Sciences and Mathematics, University of Ni?, Vi?egradska 33, 18000, Ni?, Serbia |
| Abstract: | Let G be a connected graph with vertex set V(G). The degree distance of G is defined as ${D'(G) = \sum_{\{u, v\}\subseteq V(G)} (d_G(u) + d_G (v))\, d(u,v)}$ , 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |