Strong matching preclusion for two-dimensional torus networks
DOI10.1080/00207160.2014.913034zbMATH Open1329.68189OpenAlexW1966575929MaRDI QIDQ5259052FDOQ5259052
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
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)
Cites Work
- Strong matching preclusion under the conditional fault model
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Strong matching preclusion for augmented cubes
- Strong matching preclusion for torus networks
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion for some interconnection networks
- 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
- Upper bounds on the connection probability for 2-D meshes and tori
- The lower and upper forcing geodetic numbers of completen-partite graphs,n-dimensional meshes and tori
Cited In (5)
- Strong matching preclusion for \(n\)-dimensional torus networks
- Conditional fractional matching preclusion of \(n\)-dimensional torus networks
- Strong matching preclusion for \(k\)-composition networks
- Conditional \(k\)-matching preclusion for \(n\)-dimensional torus 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)
