The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
From MaRDI portal
Publication:497342
DOI10.1007/S00373-014-1477-2zbMATH Open1327.05207OpenAlexW2086800065MaRDI QIDQ497342FDOQ497342
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
Recommendations
- The signless Laplacian spectral radius of graphs with given number of cut vertices
- The signless Laplacian spectral radius of bicyclic graphs with a given girth
- On the signless Laplacian spectral radius of graphs with cut vertices
- The signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequences
- The Signless Laplacian Spectral Radius for Bicyclic Graphs with κ Pendant Vertices
- The signless Laplacian spectral radius of graphs with a prescribed number of edges
- The signless Laplacian spectral radius of bicyclic graphs with order \(n\) and girth \(g\).
- The signless Laplacian spectral radii and spread of bicyclic graphs
- On the signless Laplacian spectral radius of bicyclic graphs with fixed diameter.
- scientific article; zbMATH DE number 7708731
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Signless Laplacians of finite graphs
- Eigenvalue bounds for the signless laplacian
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- On the spectral radius of (0,1)-matrices
- A connection between ordinary and Laplacian spectra of bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Infinite families of \(Q\)-integral graphs
- First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Signless Laplacians and line graphs
- The signless Laplacian spectral radius of graphs with given degree sequences
- On graphs whose signless Laplacian index does not exceed 4.5
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- Q-integral graphs with edge-degrees at most five
- On some forests determined by their Laplacian or signless Laplacian spectrum
- Title not available (Why is that?)
- Title not available (Why is that?)
- Not every 2-tough graph is Hamiltonian
- The largest eigenvalue of a graph: A survey
- Bounds on the index of the signless Laplacian of a graph
- Maximizing the spectral radius of bicyclic graphs with fixed girth
- The signless Laplacian spectral radius of graphs with given chromatic number
- The maximum clique and the signless Laplacian eigenvalues
- Unoriented Laplacian maximizing graphs are degree maximal
- On three conjectures involving the signless Laplacian spectral radius of graphs
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- The signless Laplacian spectral radius of graphs with given number of pendant vertices
- On the spectral radius of graphs with cut edges
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on the \(Q\)-spread of a graph
- Sharp upper bounds on the spectral radius of graphs
- Some results on the index of unicyclic graphs
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497342)