|
|||||
|
|
Ordering n-vertex cacti with matching number q by their spectral radii |
||
| Abstract: | AbstractA connected graph G is a cactus if any two of its cycles have at most one common vertex. Denote by ![/></span> the set of <i>n</i>-vertex cacti with matching number <i>q</i>. Huang, Deng and Simi? 23] identified the unique graph with the maximum spectral radius among 2<i>q</i>-vertex cacti with perfect matchings. In this paper, as a continuance of it, the largest and second largest spectral radii together with the corresponding graphs among <span class=](/na101/home/literatum/publisher/tandf/journals/content/tqma20/2014/tqma20.v037.i03/16073606.2013.779612/20141204/images/medium/tqma_a_779612_ilg0001.gif)  | |
| Keywords: | 05C50 15A18 | |
|
|||||||||||
|
|||||||||||
|
|||||||||||
|
|
|
|
| 设为首页 | 免责声明 | 关于勤云 | 加入收藏 |
|
Copyright©北京勤云科技发展有限公司 京ICP备09084417号 |