The maximum Perron roots of digraphs with some given parameters

DOI10.1016/j.disc.2013.07.016zbMath1281.05070OpenAlexW1973195334MaRDI QIDQ393930

Huiqiu Lin, Stephen W. Drury

Publication date: 24 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2013.07.016

zbMATH Keywords

digraphdiametercharacteristic polynomialPerron rootarc connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (7)

On the A_ɑ spectral radius of strongly connected digraphs ⋮ On the A_α spectral radius of digraphs with given parameters ⋮ The \(A_\alpha\) spectral radius and maximum outdegree of irregular digraphs ⋮ Spectral radius and signless Laplacian spectral radius of strongly connected digraphs ⋮ The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity ⋮ On the spectral radius of simple digraphs with prescribed number of arcs ⋮ The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters

Cites Work

• Unnamed Item
• Spectra of digraphs
• Graphs with given diameter maximizing the spectral radius
• On the spectral radius of bipartite graphs with given diameter
• Spectral radius of strongly connected digraphs
• On bags and bugs
• Matrix Analysis

This page was built for publication: The maximum Perron roots of digraphs with some given parameters