Strong matching preclusion for two-dimensional torus networks

DOI10.1080/00207160.2014.913034MaRDI QIDQ5259052zbMATHOpenAlexFDO

Authors Kai Feng, Shiying 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) Graph operations (line graphs, products, etc.) (05C76) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Strong matching preclusion for torus networks
• Strong matching preclusion for non-bipartite torus networks
• Strong matching preclusion for \(n\)-dimensional torus networks
• Matching preclusion for \(n\)-dimensional torus networks
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products

Cites work

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

Cited in

(8)

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

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

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