Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions

DOI10.1002/net.20440zbMath1248.05154OpenAlexW2102327615MaRDI QIDQ2913947

László Lipták, Eddie Cheng, Philip Hu, Roger Jia

Publication date: 21 September 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/91329

zbMATH Keywords

bipartite graphsinterconnection networksperfect matching

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (27)

Matching preclusion for vertex-transitive networks ⋮ Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars ⋮ The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Strong matching preclusion for augmented cubes ⋮ Matching preclusion for balanced hypercubes ⋮ On anti-Kekulé and \(s\)-restricted matching preclusion problems ⋮ Perfect matchings in highly cyclically connected regular graphs ⋮ Fractional matching preclusion numbers of Cartesian product graphs ⋮ Strong matching preclusion number of graphs ⋮ Integer \(k\)-matching preclusion of some interconnection networks ⋮ Strong matching preclusion of \((n,k)\)-star graphs ⋮ Matching preclusion and conditional matching preclusion for regular interconnection networks ⋮ Fractional matching preclusion of product networks ⋮ Matching preclusion number of graphs ⋮ The (conditional) matching preclusion for burnt pancake graphs ⋮ Matching preclusion number in product graphs ⋮ The fractional (strong) matching preclusion number of complete \(k\)-partite graph ⋮ Matching preclusion for \(n\)-grid graphs ⋮ A note on generalized matching preclusion in bipartite graphs ⋮ Conditional matching preclusion for regular bipartite graphs and their Cartesian product ⋮ Matching preclusion for direct product of regular graphs ⋮ Fractional matching preclusion number of graphs and the perfect matching polytope ⋮ Fractional matching preclusion number of graphs ⋮ Matching preclusion and conditional matching preclusion problems for the folded Petersen cube ⋮ Reliability analysis of the generalized balanced hypercube ⋮ Matching preclusion for cube-connected cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyper Hamiltonian laceability on edge fault star graph
• On the connectivity and superconnected graphs with small diameter
• Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• Vosperian and superconnected abelian Cayley digraphs
• Matching preclusion for the (n, k)-bubble-sort graphs
• Circulants and their connectivities
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Synthesis of reliable networks - a survey
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Matching preclusion for some interconnection networks

This page was built for publication: Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions