Integer \(k\)-matching preclusion of graphs

DOI10.1051/ro/2024064MaRDI QIDQ6667353

Caibing Chang, Yan Liu

Publication date: 20 January 2025

Published in: RAIRO. Operations Research (Search for Journal in Brave)

zbMATH Keywords

arrangement graphsinteger \(k\)-matchinginteger \(k\)-matching preclusion number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Fractional graph theory, fuzzy graph theory (05C72)

Cites Work

• Unnamed Item
• Unnamed Item
• Conditional matching preclusion for the arrangement graphs
• Strong matching preclusion
• Strong matching preclusion of \((n,k)\)-star graphs
• Conditional fault Hamiltonicity of the complete graph
• Arrangement graphs: A class of generalized star graphs
• 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
• Fractional matching preclusion for arrangement graphs
• Fractional matching preclusion of graphs
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Fractional Matching Preclusion for (n,k)-Star Graphs
• A new class of interconnection networks based on the alternating group
• Matching preclusion for some interconnection networks

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