Strong matching preclusion for \(k\)-ary \(n\)-cubes

DOI10.1016/j.dam.2013.06.011zbMath1287.05122OpenAlexW2140523929MaRDI QIDQ2446897

Kai Feng, Guozhen Zhang, Shi-ying Wang

Publication date: 23 April 2014

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

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

zbMATH Keywords

interconnection networksstrong matching preclusion\(k\)-ary \(n\)-cubesperfect and almost perfect matchings

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) 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)

Related Items (13)

Strong matching preclusion for \(n\)-dimensional torus networks ⋮ Strong matching preclusion for non-bipartite torus networks ⋮ Conditional matching preclusion number of graphs ⋮ The reliability analysis of \(k\)-ary \(n\)-cube networks ⋮ Strong matching preclusion number of graphs ⋮ Strong matching preclusion for \(k\)-composition networks ⋮ Strong matching preclusion of \((n,k)\)-star graphs ⋮ A note on the strong matching preclusion problem for data center networks ⋮ Matching preclusion number of graphs ⋮ Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes ⋮ Fractional matching preclusion number of graphs ⋮ Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks ⋮ Strong matching preclusion for two-dimensional torus networks

Cites Work

• Unnamed Item
• Unnamed Item
• Strong matching preclusion for augmented cubes
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Perfect matchings in pruned grid graphs
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• Perfect matchings after vertex deletions
• Lee distance and topological properties of k-ary n-cubes
• Matching preclusion for some interconnection networks

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