On the signless Laplacian spectral radius of weighted digraphs

DOI10.1016/J.DISOPT.2018.12.002zbMath1506.05130OpenAlexW2905721092WikidataQ128714116 ScholiaQ128714116MaRDI QIDQ2419585

Weige Xi, Li-Gong Wang

Publication date: 14 June 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2018.12.002

zbMATH Keywords

upper boundsignless Laplacian spectral radiusweighted digraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Related Items (3)

The \(A_\alpha\) spectral radius and maximum outdegree of irregular digraphs ⋮ The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity ⋮ Weight allocation in Laplacian matrix of random networks based on geodesic distances

Cites Work

• Unnamed Item
• The new upper bounds on the spectral radius of weighted graphs
• On the bounds for the largest Laplacian eigenvalues of weighted graphs
• Extremal graph characterization from the bounds of the spectral radius of weighted graphs
• A sharp upper bound on the spectral radius of weighted graphs
• Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs
• A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
• Matrix Analysis
• On the spectral radius of weighted digraphs

This page was built for publication: On the signless Laplacian spectral radius of weighted digraphs