Strong matching preclusion for torus networks

DOI10.1016/j.tcs.2013.10.023zbMath1358.68028OpenAlexW1973963767MaRDI QIDQ391769

Kai Feng, Shi-ying Wang

Publication date: 13 January 2014

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

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

zbMATH Keywords

torusinterconnection networksCartesian productstrong matching preclusion

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Strong matching preclusion for \(n\)-dimensional torus networks ⋮ Strong matching preclusion for non-bipartite torus networks ⋮ Strong matching preclusion for \(k\)-composition networks ⋮ Strong matching preclusion for two-dimensional torus networks

Cites Work

• Unnamed Item
• Unnamed Item
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion
• Perfect matchings in pruned grid graphs
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• Perfect matchings after vertex deletions
• Matching preclusion for some interconnection networks

This page was built for publication: Strong matching preclusion for torus networks