Strong matching preclusion for k-ary n-cubes

DOI10.1016/J.DAM.2013.06.011MaRDI QIDQ2446897zbMATH OpenOpenAlexFDO

Authors Kai Feng, Guozhen Zhang, Shiying 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

\(k\)-ary \(n\)-cubesinterconnection networksperfect and almost perfect matchingsstrong matching preclusion

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) 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)

Recommendations

• Matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion for augmented cubes
• Matching preclusion for k-ary n-cubes with odd k 3
• The conditional strong matching preclusion of augmented cubes
• Fractional strong matching preclusion for two variants of hypercubes
• Matching preclusion and conditional matching preclusion for crossed cubes
• Matching preclusion and conditional matching preclusion for dual-cubes
• Clique matchings in the \(k\)-ary \(n\)-dimensional cube
• Matching preclusion for balanced hypercubes
• Matching preclusion and conditional matching preclusion problems for twisted cubes

Cites work

• Conditional matching preclusion for hypercube-like interconnection networks
• Conditional matching preclusion sets
• Graph theory
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• scientific article; zbMATH DE number 5016662 (Why is no real title available?)
• Lee distance and topological properties of k-ary n-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
• Matching preclusion for some interconnection networks
• Perfect matchings after vertex deletions
• Perfect matchings in pruned grid graphs
• Strong matching preclusion
• Strong matching preclusion for augmented cubes

Cited in

(23)

• Strong matching preclusion number of graphs
• Strong matching preclusion for \(k\)-composition networks
• Matching preclusion number of graphs
• Matching preclusion for k-ary n-cubes with odd k 3
• Fractional matching preclusion number of graphs
• Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
• The reliability analysis of \(k\)-ary \(n\)-cube networks
• A note on the strong matching preclusion problem for data center networks
• Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes
• Strong matching preclusion for non-bipartite torus networks
• Strong matching preclusion for \(n\)-dimensional torus networks
• scientific article; zbMATH DE number 6000733 (Why is no real title available?)
• Strong matching preclusion for torus networks
• The conditional strong matching preclusion of augmented cubes
• Matching Preclusion for the Shuffle-Cubes
• Fractional Strong Matching Preclusion for DHcube
• Fractional strong matching preclusion for two variants of hypercubes
• Strong matching preclusion for two-dimensional torus networks
• Conditional matching preclusion number of graphs
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion for folded hypercubes
• Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
• Strong matching preclusion of (n,k)-star graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446897)