Matching extension and distance spectral radius
From MaRDI portal
Publication:6173921
DOI10.1016/j.laa.2023.06.002arXiv2303.17284MaRDI QIDQ6173921
Publication date: 13 July 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.17284
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
- Spectra of graphs
- Spectral radius of graphs with given matching number
- The matching extendability of surfaces
- Matching theory
- Matching extension and the genus of a graph
- On n-extendable graphs
- Extending matchings in graphs: A survey
- Matching extension and minimum degree
- Connectivity of \(k\)-extendable graphs with large \(k\).
- Eigenvalues and perfect matchings
- Toughness and matching extension in graphs
- Binding number and toughness for matching extension
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Spectral radius and matchings in graphs
- Perfect matching and distance spectral radius in graphs and bipartite graphs
- Distance spectra of graphs: a survey
- On k-factor-critical graphs
- The distance spectrum of a tree
- Recent Progress in Matching Extension
- Spectral conditions for graphs to be β-deficient involving minimum degree
- On spectral radius of the distance matrix
- On the Addressing Problem for Loop Switching
- On the structure of factorizable graphs
This page was built for publication: Matching extension and distance spectral radius
