Strong matching preclusion for \(k\)-composition networks

DOI10.1016/j.tcs.2017.10.033zbMath1387.68183OpenAlexW2767874026MaRDI QIDQ1698726

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

Publication date: 16 February 2018

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

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

zbMATH Keywords

interconnection networksperfect matchingalmost perfect matchingstrong 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)

Related Items (1)

A note on the strong matching preclusion problem for data center networks

Cites Work

• Strong matching preclusion for \(n\)-dimensional torus networks
• Matching preclusion for vertex-transitive networks
• Strong matching preclusion for augmented cubes
• Strong matching preclusion for torus networks
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion
• Strong matching preclusion of \((n,k)\)-star graphs
• Hamiltonian decomposition of Cayley graphs of degree 4
• Matching preclusion for balanced hypercubes
• Matching preclusion for \(n\)-dimensional torus networks
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion for two-dimensional torus networks
• Matching preclusion for some interconnection networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong matching preclusion for \(k\)-composition networks