Matching extension and matching exclusion via the size or the spectral radius of graphs
From MaRDI portal
Publication:6202947
DOI10.1016/j.dam.2024.01.001arXiv2304.12565OpenAlexW4391046883WikidataQ129666141 ScholiaQ129666141MaRDI QIDQ6202947
Shujing Miao, Wei Wei, Shuchao Li
Publication date: 27 February 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.12565
Extremal problems in graph theory (05C35) 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factors and factorizations of graphs. Proof techniques in factor theory
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- On n-extendable graphs
- On defect-d matchings in graphs
- Extending matchings in graphs: A survey
- Eigenvalues and perfect matchings
- On the spectral radius of graphs with cut edges
- Binding number and toughness for matching extension
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- On the spectrum of an equitable quotient matrix and its application
- Distance matching extension in cubic bipartite graphs
- On the \(A_\alpha\)-spectral radius of graphs without large matchings
- Spectral radius and matchings in graphs
- Regular factors in regular graphs
- Tight lower bounds on the size of a maximum matching in a regular graph
- Pan-factorial property in regular graphs
- Recent Progress in Matching Extension
- Graph Factors and Matching Extensions
- Matrix Analysis
- Remarks on regular factors of regular graphs
- Merging the A-and Q-spectral theories
- Distance restricted matching extension missing vertices and edges in 5‐connected triangulations of the plane
- Edge proximity and matching extension in projective planar graphs
- Distance matching extension and local structure of graphs
- Graphs and matrices
This page was built for publication: Matching extension and matching exclusion via the size or the spectral radius of graphs
