期刊文献+

The Q-index and Connectivity of Graphs

原文传递
导出
摘要 A connected graph G is said to be k-connected if it has more than k vertices and remains connected whenever fewer than k vertices are deleted.In this paper,for a connected graph G with sufficiently large order,we present a tight sufficient condition for G with fixed minimum degree to be k-connected based on the Q-index.Our result can be viewed as a spectral counterpart of the corresponding Dirac-type condition.
出处 《Journal of the Operations Research Society of China》 EI CSCD 2024年第2期505-519,共15页 中国运筹学会会刊(英文)
基金 the National Natural Science Foundation of China(Nos.11971311,12161141003,and 12026230) Science and Technology Commission of Shanghai Municipality(No.22JC1403600) Li-Hua Feng and Wei-Jun Liu are partly supported by the National Natural Science Foundation of China(Nos.11871479,12071484) Hunan Provincial Natural Science Foundation(Nos.2020JJ4675,2018JJ2479).
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部