scientific article; zbMATH DE number 7479742
From MaRDI portal
Publication:5036305
zbMath1486.05244MaRDI QIDQ5036305
B. N. Waphare, S. A. Mane, S. A. Kandekar
Publication date: 23 February 2022
Full work available at URL: http://www.mathjournals.org/jrms/2021-036-004/2021-036-004-007.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) 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)
Cites Work
- Unnamed Item
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
- One-to-one disjoint path covers on alternating group graphs
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
- Fault-tolerant Hamiltonicity of twisted cubes
- Many-to-many disjoint paths in faulty hypercubes
- Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
- The super laceability of the hypercubes
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
- The spanning connectivity of folded hypercubes
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids
- Spanning multi-paths in hypercubes
- An efficient construction of one-to-many node-disjoint paths in folded hypercubes
- Augmented cubes