科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let G be a connected graph. The first and the second largest distance signless Laplacian eigenvalues of G are denoted by @@@ q 1 @@@ ( G ) @@@ and @@@ q 2 @@@ ( G ) @@@ . In this paper, we determine the graphs with the minimum @@@ q 1 @@@ ( G ) @@@ among n-vertex graphs with given matching number. We also establish sharp lower bounds on @@@ q 2 @@@ ( G ) @@@ in terms of the order and the matching number of G. Moreover, the unique graph with the minimum @@@ q 2 @@@ ( G ) @@@ among the n-vertex connected graphs with fixed connectivity is identified.
