Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs

DOI10.1016/j.amc.2022.127638OpenAlexW4307102003MaRDI QIDQ2101922

Caibing Chang, Yan Liu, Xianfu Li

Publication date: 7 December 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127638

zbMATH Keywords

twisted cubenumberinteger \(k\)-matching(strong) integer \(k\)-matching preclusion\((n,s)\)-star graph

Mathematics Subject Classification ID

Computer system organization (68Mxx) Graph theory (05Cxx) Operations research and management science (90Bxx)

Related Items (1)

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

Cites Work

• Strong matching preclusion
• Fault-tolerant Hamiltonicity of twisted cubes
• Strong matching preclusion of \((n,k)\)-star graphs
• Conditional fault Hamiltonicity of the complete graph
• Integer \(k\)-matchings of graphs
• Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers
• Fractional matching preclusion of graphs
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Fractional Matching Preclusion for (n,k)-Star Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs