Strong matching preclusion for n-dimensional torus networks

DOI10.1016/J.TCS.2016.05.008MaRDI QIDQ287442zbMATH OpenOpenAlexFDO

Authors Yingzhi Tian, Xiaodong Liang, Xiaomin Hu, Jixiang 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

almost perfect matchingperfect matchingstrong matching preclusiontorus networks

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 5016662 (Why is no real title available?)
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Matching preclusion for balanced hypercubes
• Matching preclusion for cube-connected cycles
• Matching preclusion for some interconnection networks
• Strong matching preclusion
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion for augmented cubes
• Strong matching preclusion for torus networks
• Strong matching preclusion for two-dimensional torus networks
• Strong matching preclusion of (n,k)-star graphs
• Strong matching preclusion under the conditional fault model

Cited in

(9)

• Strong matching preclusion for \(k\)-composition networks
• Matching preclusion for \(n\)-dimensional torus networks
• Strong matching preclusion for non-bipartite torus networks
• Conditional fractional matching preclusion of \(n\)-dimensional torus networks
• Strong matching preclusion for torus networks
• Strong matching preclusion for two-dimensional torus networks
• Conditional \(k\)-matching preclusion for \(n\)-dimensional torus networks
• Conditional matching preclusion of enhanced hypercubes
• Strong matching preclusion for folded hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287442)