Strong matching preclusion for two-dimensional torus networks

DOI10.1080/00207160.2014.913034zbMath1329.68189OpenAlexW1966575929MaRDI QIDQ5259052

Kai Feng, Shi-ying Wang

Publication date: 24 June 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.913034

zbMATH Keywords

torusfault toleranceinterconnection networksCartesian product graphsstrong matching preclusion

Mathematics Subject Classification ID

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 (3)

Strong matching preclusion for \(n\)-dimensional torus networks ⋮ 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
• Upper bounds on the connection probability for 2-D meshes and tori
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion
• Conditional matching preclusion sets
• Panconnectivity of \(n\)-dimensional torus networks with faulty vertices and edges
• Strong matching preclusion under the conditional fault model
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• The lower and upper forcing geodetic numbers of completen-partite graphs,n-dimensional meshes and tori
• Matching preclusion for some interconnection networks

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