A note on generalized matching preclusion in bipartite graphs

DOI10.1016/j.tcs.2019.05.022zbMath1433.05263OpenAlexW2947267099MaRDI QIDQ2272412

Christopher Melekian, Eddie Cheng

Publication date: 10 September 2019

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

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

zbMATH Keywords

bipartite graphsmatchingsinterconnection networksmatching preclusion

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks

Cites Work

• Unnamed Item
• Matching preclusion for vertex-transitive networks
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Strong matching preclusion
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• A note on 1-factors in certain regular multigraphs
• Matching preclusion for balanced hypercubes
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• Linearly many faults in Cayley graphs generated by transposition trees
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
• FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
• Robust recoverable perfect matchings
• Generalized Matching Preclusion in Bipartite Graphs
• Matching preclusion for some interconnection networks

This page was built for publication: A note on generalized matching preclusion in bipartite graphs