scholarly journals The spanning k-trees, perfect matchings and spectral radius of graphs

Author(s):  
Dandan Fan ◽  
Sergey Goryainov ◽  
Xueyi Huang ◽  
Huiqiu Lin
2011 ◽  
Vol 5 (1) ◽  
pp. 14-21 ◽  
Author(s):  
Ziwen Huang ◽  
Hanyuan Deng ◽  
Slobodan Simic

Let C(2m, k) be the set of all cactuses on 2m vertices, k cycles, and with perfect matchings. In this paper, we identify in C(2m, k) the unique graph with the largest spectral radius.


2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Jing-Ming Zhang ◽  
Ting-Zhu Huang ◽  
Ji-Ming Guo

The graph with the largest signless Laplacian spectral radius among all bicyclic graphs with perfect matchings is determined.


1989 ◽  
Vol 15 (1) ◽  
pp. 275
Author(s):  
NADKARNI ◽  
ROBERTSON
Keyword(s):  

2017 ◽  
Vol 60 (2) ◽  
pp. 411-421
Author(s):  
Luchezar Stoyanov

AbstractWe prove a comprehensive version of the Ruelle–Perron–Frobenius Theorem with explicit estimates of the spectral radius of the Ruelle transfer operator and various other quantities related to spectral properties of this operator. The novelty here is that the Hölder constant of the function generating the operator appears only polynomially, not exponentially as in previously known estimates.


Sign in / Sign up

Export Citation Format

Share Document