Conditional matching preclusion for regular bipartite graphs and their Cartesian product

DOI10.1016/J.DAM.2021.04.011MaRDI QIDQ2028067zbMATH OpenOpenAlexFDO

Authors 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 productconditional matching preclusion numberconditionally maximally matchedconditionally super matchedregular bipartite graph

Mathematics Subject Classification ID

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

Recommendations

• Matching preclusion for direct product of regular graphs
• Conditional matching preclusion for the arrangement graphs
• Generalized Matching Preclusion in Bipartite Graphs
• A note on generalized matching preclusion in bipartite graphs
• Fractional matching preclusion numbers of Cartesian product graphs
• Conditional matching preclusion number of graphs
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Conditional matching preclusion for the alternating group graphs and Split-stars
• CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
• Conditional matching preclusion for Cayley graphs generated by transposition trees

Cites work

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

Cited in

(9)

• A note on generalized matching preclusion in bipartite graphs
• Matching preclusion for direct product of regular graphs
• The (conditional) matching preclusion for burnt pancake graphs
• Conditional matching preclusion for the star graphs.
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
• scientific article; zbMATH DE number 5919743 (Why is no real title available?)
• Generalized Matching Preclusion in Bipartite Graphs
• CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
• Higher order matching preclusion for regular interconnection networks

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

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