Integer \(k\)-matching preclusion of some interconnection networks

DOI10.1016/j.tcs.2024.114449OpenAlexW4391934233MaRDI QIDQ6190003

Li'Na Ba, Heping Zhang, Hailun Wu

Publication date: 5 March 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114449

zbMATH Keywords

hypercube-like graphtorus networkaugmented cube\(k\)-matching preclusionstrong \(k\)-matching preclusion

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Strong matching preclusion for augmented cubes
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Strong matching preclusion
• Matching theory
• Integer \(k\)-matchings of graphs
• Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers
• Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
• Matching preclusion for \(n\)-dimensional torus networks
• Fractional matching preclusion of graphs
• On perfect \(k\)-matchings
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
• Augmented cubes
• Fractional matching preclusion for generalized augmented cubes

This page was built for publication: Integer \(k\)-matching preclusion of some interconnection networks