Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs
From MaRDI portal
Publication:339488
DOI10.7151/DMGT.1915zbMATH Open1350.05099OpenAlexW2496714234MaRDI QIDQ339488FDOQ339488
Publication date: 11 November 2016
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1915
Recommendations
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
- The signless Laplacian spectral radius of some strongly connected digraphs
- Sharp bounds for the signless Laplacian spectral radius of digraphs
- Some upper bounds for the signless Laplacian spectral radius of digraphs
- scientific article; zbMATH DE number 6260070
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)
Cites Work
- Matrix Analysis
- Ordering (signless) Laplacian spectral radii with maximum degrees of graphs
- Maximizing the sum of the squares of the degrees of a graph
- Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph
- Sharp bounds for the signless Laplacian spectral radius of digraphs
- Title not available (Why is that?)
- Sharp bounds on the signless Laplacian spectral radii of graphs
- A lower bound for the spectral radius of a digraph
- Sharp upper bounds for the Laplacian graph eigenvalues
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- The Laplacian spectrum of a graph
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
- Bounds on the spectral radii of digraphs in terms of walks
- A sharp upper bound on the signless Laplacian spectral radius of graphs
- Sharp bounds on the spectral radius of nonnegative matrices and digraphs
- Bounds on the index of the signless Laplacian of a graph
- Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
Cited In (11)
- Some upper bounds for the signless Laplacian spectral radius of digraphs
- On the generalized adjacency spectral radius of digraphs
- The eccentricity matrix of a digraph
- Some new sharp bounds for the spectral radius of a nonnegative matrix and its application
- On the first outdegree Zagreb index of a digraph
- On the Aα spectral radius of digraphs with given parameters
- Title not available (Why is that?)
- On the A_ɑ spectral radius of strongly connected digraphs
- On the spectral radius of the generalized adjacency matrix of a digraph
- The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity
- Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs
This page was built for publication: Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339488)