Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs

DOI10.1016/J.LAA.2024.08.004zbMATH Open1548.05225MaRDI QIDQ6615460

Publication date: 8 October 2024

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Could not fetch data.

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

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Spectral radius and fractional matchings in graphs
A characterization of maximal non-\(k\)-factor-critical graphs
Large matchings from eigenvalues
Matchings in regular graphs from eigenvalues
A bound on the spectral radius of graphs
On the spectral radius of unicyclic graphs with perfect matchings
Integer \(k\)-matchings of graphs
Eigenvalues and perfect matchings
Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs
Closure and factor-critical graphs
Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers
A characterization for graphs having strong parity factors
Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
Proof of a conjecture on the spectral radius condition for \([a,b\)-factors]
Spectral radius and \([a,b\)-factors in graphs]
On specific factors in graphs
Spectral radius and matchings in graphs
On perfect \(k\)-matchings
Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs
On \(k\)-factor-critical graphs
Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
On the structure of factorizable graphs
The spanning k-trees, perfect matchings and spectral radius of graphs
Spectral radius and Hamiltonicity of graphs
Eigenvalues and [a,b‐factors in regular graphs]

This page was built for publication: Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs

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