On the Distance Signless Laplacian Spectral Radius of Bicyclic Graphs  

作　　者：Nannan XU Aimei YU 

机构地区：[1]School of Mathematics and Stastics,Beijing Jiaotong University,Beijing 100044,P.R.China

出　　处：《Journal of Mathematical Research with Applications》2023年第3期289-302,共14页数学研究及应用（英文版）

基　　金：Supported by the National Natural Science Foundation of China (Grant No.11971054)。

摘　　要：The distance signless Laplacian matrix of a connected graph G is defined as Q(G)=Tr(G)+D(G), where Tr(G) is the diagonal matrix of the vertex transmissions in G and D(G) is the distance matrix of G. The largest eigenvalue of the distance signless Laplacian matrix is called the distance signless Laplacian spectral radius of G. In this paper, we determine the unique graph with the maximum distance signless Laplacian spectral radius among all the bicyclic graphs with given order.

关 键 词：distance signless Laplacian matrix spectral radius bicyclic graph 

分 类 号：O157.5[理学—数学]