scholarly journals Oriented bicyclic graphs whose skew spectral radius does not exceed 2

2013 ◽  
Author(s):  
Ji Jia-Hui ◽  
Xu Guang-Hui
Keyword(s):  
Spectral Radius ◽  
Bicyclic Graphs

Unbalanced unicyclic and bicyclic graphs with extremal spectral radius

2020 ◽  
pp. 1-17
Author(s):  
Francesco Belardo ◽  
Maurizio Brunetti ◽  
Adriana Ciampella
Keyword(s):  
Spectral Radius ◽  
Bicyclic Graphs

scholarly journals On the spectral radius of bicyclic graphs

2005 ◽  
Vol 131 (30) ◽  
pp. 93-99 ◽  
Author(s):  
M. Petrovic ◽  
I. Gutman ◽  
Shu-Guang Guo
Keyword(s):  
Spectral Radius ◽  
Bicyclic Graphs

scholarly journals On the Signless Laplacian Spectral Radius of Bicyclic Graphs with Perfect Matchings

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Jing-Ming Zhang ◽  
Ting-Zhu Huang ◽  
Ji-Ming Guo
Keyword(s):  
Spectral Radius ◽  
Perfect Matchings ◽  
Laplacian Spectral Radius ◽  
Signless Laplacian Spectral Radius ◽  
Signless Laplacian ◽  
Bicyclic Graphs

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

scholarly journals On ordering bicyclic graphs with respect to the Laplacian spectral radius

2011 ◽  
Vol 24 (12) ◽  
pp. 2186-2192 ◽  
Author(s):  
Shuchao Li ◽  
Slobodan K. Simić ◽  
Dejan V. Tošić ◽  
Qin Zhao
Keyword(s):  
Spectral Radius ◽  
Laplacian Spectral Radius ◽  
Bicyclic Graphs

ON THE MINIMAL DISTANCE SPECTRAL RADIUS IN THE CLASS OF BICYCLIC GRAPHS

2014 ◽  
Vol 06 (01) ◽  
pp. 1450014 ◽  
Author(s):  
MILAN NATH ◽  
SOMNATH PAUL
Keyword(s):  
Spectral Radius ◽  
Complete Characterization ◽  
Minimal Distance ◽  
Connected Graphs ◽  
Bicyclic Graphs

Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. The class of bicyclic graphs of order n, denoted by ℬn, can be partitioned into two subclasses: the class [Formula: see text] of graphs which contain induced ∞-graphs, and the class [Formula: see text] of graphs which contain induced θ-graphs. Bose et al. [2] have found the graph having the minimal distance spectral radius in [Formula: see text]. In this paper, we determine the graphs having the minimal distance spectral radius in [Formula: see text]. These results together give a complete characterization of the graphs having the minimal distance spectral radius in ℬn.

Sign in / Sign up

Export Citation Format

Share Document