Conditional matching preclusion for regular bipartite graphs and their Cartesian product

DOI10.1016/j.dam.2021.04.011zbMath1465.05152OpenAlexW3164771130MaRDI QIDQ2028067

Ruizhi Lin

Publication date: 31 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.04.011

zbMATH Keywords

Cartesian productregular bipartite graphconditional matching preclusion numberconditionally maximally matchedconditionally super matched

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Matching preclusion for vertex-transitive networks
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Note on matching preclusion number of random graphs
• Conditional matching preclusion sets
• Matching preclusion number of graphs
• Matching preclusion number in product graphs
• Matching preclusion for balanced hypercubes
• Matching preclusion for direct product of regular graphs
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• Matching preclusion for cube-connected cycles
• Matching preclusion for \(n\)-dimensional torus networks
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• The (conditional) matching preclusion for burnt pancake graphs
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
• Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
• Construction of a Maximum Stable Set with $k$-Extensions
• Unnamed Item

This page was built for publication: Conditional matching preclusion for regular bipartite graphs and their Cartesian product