Strong matching preclusion for \(n\)-dimensional torus networks

DOI10.1016/j.tcs.2016.05.008zbMath1339.05312OpenAlexW2346866522MaRDI QIDQ287442

Yingzhi Tian, Xiaodong Liang, Xiao-Min Hu, Ji Xiang Meng

Publication date: 26 May 2016

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

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

zbMATH Keywords

perfect matchingtorus networksalmost perfect matchingstrong matching preclusion

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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

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

Cites Work

• Strong matching preclusion for augmented cubes
• Strong matching preclusion for torus networks
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion
• Strong matching preclusion of \((n,k)\)-star graphs
• Matching preclusion for balanced hypercubes
• Strong matching preclusion under the conditional fault model
• Matching preclusion for cube-connected cycles
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion for two-dimensional torus networks
• Matching preclusion for some interconnection networks
• Unnamed Item

This page was built for publication: Strong matching preclusion for \(n\)-dimensional torus networks