Ordering Quasi-tree Graphs on n Vertices by Their Spectral Radii
Ordering Quasi-tree Graphs on n Vertices by Their Spectral Radii
投稿时间:2017-04-29  最后修改时间:2017-05-09
DOI:
中文关键词:  
英文关键词:Quasi-tree graph  Spectral radius  Extremal graph
基金项目:
作者单位E-mail
郭曙光 盐城师范学院 ychgsg@163.com 
罗可 青海师范大学 luoke_hn@163.com 
林震 青海师范大学 LNLinZhen@163.com 
摘要点击次数: 229
全文下载次数: 
中文摘要:
      
英文摘要:
      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. Liu and Lu [Linear Algebra Appl. 428 (2008) 2708-2714] determined the maximal spectral radius together with the corresponding graph among all quasi-tree graphs on $n$ vertices. In this paper, we extend their result, and determine the second to the fifth largest spectral radii together with the corresponding graphs among all quasi-tree graphs on $n$ vertices.
查看全文  查看/发表评论  下载PDF阅读器