Maximizing the spectral radius of generalized cactus graphs

DOI10.1051/RO/2026035MaRDI QIDQ7312927zbMATH OpenFDO

Authors Zeyuan Wu, Hongzhang Chen, Jianxi Li

Publication date 12 August 2026

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2026035

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• A survey on spectral conditions for some extremal graph problems
• Cacti whose spread is maximal
• Domination number and (signless Laplacian) spectral radius of cactus graphs
• Independence number and spectral radius of cactus graphs
• Maximizing the spectral radius of k-connected graphs with given diameter
• Maximizing the spectral radius of bicyclic graphs with fixed girth
• On the eigenvalues of trees
• On the index of cactuses with n vertices
• On the sizes of generalized cactus graphs
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Ordering n-vertex cacti with matching number q by their spectral radii
• Ordering cacti with signless Laplacian spread
• Spectra of graphs
• Spectral radius of graphs
• Spectral radius of graphs with given matching number
• The spectral radius of graphs with given independence number
• The spectral radius of trees on \(k\) pendant vertices

This page was built for publication: Maximizing the spectral radius of generalized cactus graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312927)