Matching preclusion for balanced hypercubes
From MaRDI portal
Publication:1929236
DOI10.1016/j.tcs.2012.09.020zbMath1254.68188MaRDI QIDQ1929236
Huazhong Lü, Heping Zhang, Xianyue Li
Publication date: 7 January 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.020
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Fractional Strong Matching Preclusion for DHcube, Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults, On extra connectivity and extra edge-connectivity of balanced hypercubes, On anti-Kekulé and \(s\)-restricted matching preclusion problems, Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest, An Efficient Algorithm for Embedding Two-Dimensional Tori into Balanced Hypercubes, Hamiltonian cycle embedding for fault tolerance in balanced hypercubes, Strong matching preclusion for \(n\)-dimensional torus networks, Matching preclusion for vertex-transitive networks, On the edge-hyper-Hamiltonian laceability of balanced hypercubes, Strong matching preclusion for augmented cubes, Vertex-fault-tolerant cycles embedding in balanced hypercubes, Various cycles embedding in faulty balanced hypercubes, Fault-tolerant Hamiltonian laceability of balanced hypercubes, Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks, Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes, Strong matching preclusion for \(k\)-composition networks, Cycles embedding in balanced hypercubes with faulty edges and vertices, Edge-disjoint Hamiltonian cycles of balanced hypercubes, Matching preclusion number in product graphs, Hamiltonian paths passing through prescribed edges in balanced hypercubes, Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes, Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes, Matching preclusion for \(n\)-grid graphs, Structure and substructure connectivity of balanced hypercubes, Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\), Conditional matching preclusion for regular bipartite graphs and their Cartesian product, Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links, The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs, Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes, The reliability analysis based on the generalized connectivity in balanced hypercubes, A note on generalized matching preclusion in bipartite graphs, Matching preclusion for direct product of regular graphs, Fractional matching preclusion number of graphs and the perfect matching polytope, Path embeddings with prescribed edge in the balanced hypercube network, Matching preclusion and conditional matching preclusion problems for the folded Petersen cube, Matching preclusion for cube-connected cycles, Matching preclusion for \(n\)-dimensional torus networks, Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs, Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes, On extra connectivity and extra edge-connectivity of balanced hypercubes, Conditional fractional matching preclusion of \(n\)-dimensional torus networks, Hamiltonian cycles of balanced hypercube with more faulty edges, The genus of the balanced hypercube
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Bipanconnectivity of balanced hypercubes
- Conditional matching preclusion for the arrangement graphs
- Strong matching preclusion
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
- Matching preclusion for some interconnection networks
