首页 | 本学科首页   官方微博 | 高级检索  
     检索      

拟树图按第二大无符号拉普拉斯特征值排序
引用本文:林震,郭曙光,苗连英.拟树图按第二大无符号拉普拉斯特征值排序[J].数学研究及应用,2020,40(5):453-466.
作者姓名:林震  郭曙光  苗连英
作者单位:中国矿业大学数学学院,江苏 徐州 221116;盐城师范学院数学与统计学院,江苏 盐城 224002
基金项目:国家自然科学基金(Grant No.11771443), 中央高校基本科研业务费专项资金(Grant No.2018BSCXB24),江苏省研究生科研与实践创新计划项目(Grant No.KYCX18_1980).
摘    要:A connected graph G=(V,E) is called a quasi-tree graph if there exists a vertex v_0∈V(G) such that G-v_0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian eigenvalue greater than or equal to n-3.As an application,we determine all quasi-tree graphs of order n with the sum of the two largest signless Laplacian eigenvalues greater than to 2 n-5/4.

关 键 词:拟树图  无符号拉普拉斯矩阵  第二大特征值  特征值的和  排序
收稿时间:2019/9/4 0:00:00
修稿时间:2020/3/17 0:00:00

Ordering Quasi-Tree Graphs by the Second Largest Signless Laplacian Eigenvalues
Zhen LIN,Shuguang GUO,Lianying MIAO.Ordering Quasi-Tree Graphs by the Second Largest Signless Laplacian Eigenvalues[J].Journal of Mathematical Research with Applications,2020,40(5):453-466.
Authors:Zhen LIN  Shuguang GUO  Lianying MIAO
Institution:School of Mathematics, China University of Mining and Technology, Jiangsu 221116, P. R. China;School of Mathematics and Statistics, Yancheng Teachers University, Jiangsu 224002, P. R. China
Abstract:A connected graph $G=(V, E)$ is called a quasi-tree graph if there exists a vertex $v_0\in V(G)$ such that $G-v_0$ is a tree. In this paper, we determine all quasi-tree graphs of order $n$ with the second largest signless Laplacian eigenvalue greater than or equal to $n-3$. As an application, we determine all quasi-tree graphs of order $n$ with the sum of the two largest signless Laplacian eigenvalues greater than to $2n-\frac{5}{4}$.
Keywords:quasi-tree graph  signless Laplacian matrix  second largest eigenvalue  sum of eigenvalues  ordering
本文献已被 CNKI 等数据库收录!
点击此处可从《数学研究及应用》浏览原始摘要信息
点击此处可从《数学研究及应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号