数学研究及应用2024,Vol.44Issue(3) :304-312.DOI:10.3770/j.issn:2095-2651.2024.03.003

A Note on the Signless Laplacian Spectral Ordering of Graphs with Given Size

Nannan LIU Shuguang GUO
数学研究及应用2024,Vol.44Issue(3) :304-312.DOI:10.3770/j.issn:2095-2651.2024.03.003

A Note on the Signless Laplacian Spectral Ordering of Graphs with Given Size

Nannan LIU 1Shuguang GUO2
扫码查看

作者信息

  • 1. School of Mathematics and Statistics,Qinghai Normal University,Qinghai 810008,P.R.China;School of Mathematics and Statistics,Yancheng Teachers University,Jiangsu 224002,P.R.China
  • 2. School of Mathematics and Statistics,Yancheng Teachers University,Jiangsu 224002,P.R.China
  • 折叠

Abstract

For a simple undirected graph G with fixed size m ≥ 2k(k ∈ Z+)and maximum degree Δ(G)≤ m-k,we give an upper bound on the signless Laplacian spectral radius q(G)of G.For two connected graphs G1 and G2 with size m ≥ 8,employing this upper bound,we prove that q(G1)>q(G2)if Δ(G1)>Δ(G2)+1 and Δ(G1)≥ m/2+2.For triangle-free graphs,we prove two stronger results.As an application,we completely characterize the graph with maximal signless Laplacian spectral radius among all graphs with size m and circumference c for m ≥ max{2c,c+9},which partially answers the question proposed by Chen et al.in[Linear Algebra Appl.,2022,645:123-136].

Key words

signless Laplacian spectral radius/upper bound/ordering/size/circumference

引用本文复制引用

基金项目

National Natural Science Foundation of China(12071411)

National Natural Science Foundation of China(12171222)

出版年

2024
数学研究及应用
大连理工大学

数学研究及应用

CSCD
影响因子:0.094
ISSN:2095-2651
参考文献量30
段落导航相关论文