双圈图的Seidel无符号拉普拉斯能量

Seidel signless Laplacian energy of Bicyclic Graphs

设G是具有顶点n,边数m的简单图。定义G的Seidel无符号拉普拉斯能量为Seidel无符号拉普拉斯矩阵的特征值与n(n-1)-4m/n的差的绝对值之和。文中利用不等式技巧讨论了双圈图的Seidel无符号拉普拉斯能量的上界,得到了几个有意义的结果。

Let G be a simple graph with vertices n and edges m.The Seidel signless Laplacian energy of G is defined as the sum of the absolute deviations of the eigenvalues of the Seidel signless Laplacian matrix from(n(n-1)-4m)/n.In this paper,using inequality technique,the upper bounds of the Seidel signless Laplacian energy of bicyclic graphs were discussed,and some significant conclusions were obtained.