Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
Publication:2913947
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
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)
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