Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs

DOI10.7151/dmgt.1915zbMath1350.05099OpenAlexW2496714234MaRDI QIDQ339488

Li-Gong Wang, Weige Xi

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

zbMATH Keywords

digraphsignless Laplacian spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (10)

On the A_ɑ spectral radius of strongly connected digraphs ⋮ On the generalized adjacency spectral radius of digraphs ⋮ Some upper bounds for the signless Laplacian spectral radius of digraphs ⋮ Some new sharp bounds for the spectral radius of a nonnegative matrix and its application ⋮ On the A_α spectral radius of digraphs with given parameters ⋮ On the spectral radius of the generalized adjacency matrix of a digraph ⋮ On the first outdegree Zagreb index of a digraph ⋮ Unnamed Item ⋮ The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity ⋮ The eccentricity matrix of a digraph

Cites Work

• Unnamed Item
• Sharp bounds for the signless Laplacian spectral radius of digraphs
• Ordering (signless) Laplacian spectral radii with maximum degrees of graphs
• Sharp bounds on the signless Laplacian spectral radii of graphs
• Bounds on the index of the signless Laplacian of a graph
• A lower bound for the spectral radius of a digraph
• Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
• The Laplacian spectrum of a graph
• Sharp upper bounds for the Laplacian graph eigenvalues
• Maximizing the sum of the squares of the degrees 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
• Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph
• A sharp upper bound on the signless Laplacian spectral radius of graphs
• Sharp bounds on the spectral radius of nonnegative matrices and digraphs
• Matrix Analysis

This page was built for publication: Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs