Matching preclusion for \(k\)-ary \(n\)-cubes

DOI10.1016/j.dam.2010.08.017zbMath1215.05137OpenAlexW1965356236MaRDI QIDQ608299

Jing Li, Ruixia Wang, Shang-Wei Lin, Shi-ying Wang

Publication date: 25 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.017

zbMATH Keywords

interconnection networksperfect matchingalmost perfect matching\(k\)-ary \(n\)-cubes

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (36)

Strong matching preclusion for \(n\)-dimensional torus networks ⋮ Matching preclusion for vertex-transitive networks ⋮ The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ Strong matching preclusion for non-bipartite torus networks ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs ⋮ Strong matching preclusion for augmented cubes ⋮ Strong matching preclusion for torus networks ⋮ Matching preclusion for balanced hypercubes ⋮ On anti-Kekulé and \(s\)-restricted matching preclusion problems ⋮ Fractional matching preclusion numbers of Cartesian product graphs ⋮ Strong matching preclusion number of graphs ⋮ Strong matching preclusion for \(k\)-composition networks ⋮ Strong matching preclusion of \((n,k)\)-star graphs ⋮ Strong matching preclusion under the conditional fault model ⋮ Matching preclusion and conditional matching preclusion for regular interconnection networks ⋮ Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products ⋮ Fractional matching preclusion of product networks ⋮ Matching preclusion number of graphs ⋮ The (conditional) matching preclusion for burnt pancake graphs ⋮ Strong matching preclusion for \(k\)-ary \(n\)-cubes ⋮ Conditional matching preclusion for the arrangement graphs ⋮ Matching preclusion number in product graphs ⋮ The fractional (strong) matching preclusion number of complete \(k\)-partite graph ⋮ CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS ⋮ Matching preclusion for \(n\)-grid graphs ⋮ Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\) ⋮ Conditional matching preclusion for regular bipartite graphs and their Cartesian product ⋮ Conditional fault tolerance in a class of Cayley graphs ⋮ Matching preclusion for direct product of regular graphs ⋮ Fractional matching preclusion number of graphs and the perfect matching polytope ⋮ Fractional matching preclusion number of graphs ⋮ Strong matching preclusion for two-dimensional torus networks ⋮ Matching preclusion and conditional matching preclusion problems for the folded Petersen cube ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES ⋮ Matching preclusion for cube-connected cycles ⋮ Matching preclusion for \(n\)-dimensional torus networks

Cites Work

• Unnamed Item
• Unnamed Item
• Path embeddings in faulty 3-ary \(n\)-cubes
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• On \(k\)-ary \(n\)-cubes: Theory and applications.
• Lee distance and topological properties of k-ary n-cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Matching preclusion for some interconnection networks

This page was built for publication: Matching preclusion for \(k\)-ary \(n\)-cubes