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

DOI10.1016/j.tcs.2016.05.008zbMath1339.05312MaRDI 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 matching; torus networks; almost perfect matching; strong matching preclusion

Mathematics Subject Classification ID

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

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)