The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges

DOI10.1007/s00373-014-1477-2zbMath1327.05207OpenAlexW2086800065MaRDI QIDQ497342

Zhen-Mu Hong, Yi-Zheng Fan

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1477-2

zbMATH Keywords

spectral radiusadjacency matrixsignless Laplaciancut edgebicyclic graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (1)

On the \(A_\sigma\)-spectral radii of graphs with some given parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a signless Laplacian spectral characterization of \(T\)-shape trees
• Signless Laplacians of finite graphs
• Unoriented Laplacian maximizing graphs are degree maximal
• Q-integral graphs with edge-degrees at most five
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Bounds on the \(Q\)-spread of a graph
• Infinite families of \(Q\)-integral graphs
• The signless Laplacian spectral radius of graphs with given degree sequences
• Bounds on the index of the signless Laplacian of a graph
• On some forests determined by their Laplacian or signless Laplacian spectrum
• On the maximal signless Laplacian spectral radius of graphs with given matching number
• On graphs whose signless Laplacian index does not exceed 4.5
• First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
• Maximizing the spectral radius of bicyclic graphs with fixed girth
• The signless Laplacian spectral radius of graphs with given number of pendant vertices
• On the spectral radius of (0,1)-matrices
• Sharp upper bounds on the spectral radius of graphs
• On the spectral radius of graphs
• The spectral radius of trees on \(k\) pendant vertices
• Some new bounds on the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges
• Not every 2-tough graph is Hamiltonian
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Some results on the index of unicyclic graphs
• A connection between ordinary and Laplacian spectra of bipartite graphs
• Eigenvalue bounds for the signless laplacian
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• The maximum clique and the signless Laplacian eigenvalues
• On three conjectures involving the signless Laplacian spectral radius of graphs
• The largest eigenvalue of a graph: A survey
• Towards a spectral theory of graphs based on the signless Laplacian, III
• Signless Laplacians and line graphs

This page was built for publication: The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges