Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
From MaRDI portal
Publication:2913947
DOI10.1002/net.20440zbMath1248.05154MaRDI 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
05C82: Small world graphs, complex networks (graph-theoretic aspects)
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks, 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, Matching preclusion for vertex-transitive networks, Strong matching preclusion for augmented cubes, Matching preclusion and conditional matching preclusion for regular interconnection networks, Strong matching preclusion of \((n,k)\)-star graphs, Strong matching preclusion number of graphs, Matching preclusion number of graphs, Matching preclusion number in product graphs, Matching preclusion for \(n\)-grid graphs, Matching preclusion for balanced hypercubes, Conditional matching preclusion for regular bipartite graphs and their Cartesian product, Fractional matching preclusion number of graphs, Reliability analysis of the generalized balanced hypercube, The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs, Fractional matching preclusion of product networks, The fractional (strong) matching preclusion number of complete \(k\)-partite graph, A note on generalized matching preclusion in bipartite graphs, Matching preclusion for direct product of regular graphs, Fractional matching preclusion number of graphs and the perfect matching polytope, Matching preclusion and conditional matching preclusion problems for the folded Petersen cube, Matching preclusion for cube-connected cycles, The (conditional) matching preclusion for burnt pancake graphs, Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
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
