On the spectral radius of unicyclic graphs with perfect matchings
On the spectral radius of unicyclic graphs with perfect matchings
复制标题
关于完美匹配单圈图的谱半径
DOI：
10.1016/s0024-3795(03)00394-x
复制
发表时间：
2003-09-01
影响因子：
1.1
通讯作者：
Tian, F
中科院分区：
文献类型：
--
作者：
Chang, A;Tian, F
设U+（2k）是2k（k ≥ 2）个顶点上具有完美匹配的所有单圈图的集合。设U-2k（1）是由C-3通过在C-3的一个顶点上附加一条悬挂边和k - 2条长度为2的路而得到的2k个顶点上的图;设U-2k（2）是由2k个C-3通过在每个顶点上附加一条悬挂边和在三个顶点之一上附加k - 3条长度为2的路而得到的2k个顶点上的图。本文证明了当k不等于3时，U+（2k）中的图U-2k（1）和U-2k（2）具有最大和次大的谱半径. (C)2003年爱思唯尔公司All rights reserved.
Let U+(2k) be the set of all unicyclic graphs on 2k (k greater than or equal to 2) vertices with perfect matchings. Let U-2k(1) be the graph on 2k vertices obtained from C-3 by attaching a pendant edge and k - 2 paths of length 2 at one vertex of C-3; Let U-2k(2) be the graph on 2k vertices obtained from 2k C-3 by adding a pendant edge at each vertex together with k - 3 paths of length 2 at one of three vertices. In this paper, we prove that U-2k(1) and U-2k(2) have the largest and the second largest spectral radius among the graphs in U+ (2k) when k not equal 3. (C) 2003 Elsevier Inc. All rights reserved.