Constructing the mate of cospectral 5-regular graphs with and without a perfect matching

DOI10.18523/2617-70804202124-27MaRDI QIDQ6568612FDOQ6568612

Authors: V. O. Sobolev, V. O. Solomko 

Publication date: 8 July 2024

Published in: Mogylyans'kyĭ Matematychnyĭ Zhurnal (Search for Journal in Brave)

Recommendations

• Cospectral regular graphs with and without a perfect matching
• On perfect \(k\)-matchings
• Matchings in regular graphs from eigenvalues
• Perfect matchings, eigenvalues and expansion
• Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs

zbMATH Keywords

cospectral graphsperfect matchingregular graphGodsil-McKay switching

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)

This page was built for publication: Constructing the mate of cospectral 5-regular graphs with and without a perfect matching

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