Spectral radius and maximum matching covered graphs

DOI10.1016/J.DISC.2026.115230MaRDI QIDQ7313979zbMATH OpenFDO

Authors Mengyuan Niu, Liwen Lian, Xiumei Wang

Publication date 13 August 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115230

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• A note on minimal matching covered graphs
• Graph theory
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 193132 (Why is no real title available?)
• Laminar tight cuts in matching covered graphs
• Matching extension and distance spectral radius
• Matching extension and matching exclusion via the size or the spectral radius of graphs
• Matching theory
• Matrix Analysis
• Merging the \(A\)- and \(Q\)-spectral theories
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• On defect-d matchings in graphs
• On representatives of subsets.
• On tight cuts in matching covered graphs
• On two unsolved problems concerning matching covered graphs
• Spectra of graphs

This page was built for publication: Spectral radius and maximum matching covered graphs

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