Matching preclusion for k-ary n-cubes
From MaRDI portal
Publication:608299
DOI10.1016/J.DAM.2010.08.017zbMATH Open1215.05137OpenAlexW1965356236MaRDI QIDQ608299FDOQ608299
Authors: Ruixia Wang, Jing Li, Shiying Wang, Shangwei Lin 
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
Recommendations
- Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Conditional matching preclusion for hypercube-like interconnection networks
- Matching preclusion and conditional matching preclusion for crossed cubes
Cites Work
- Graph theory
- Lee distance and topological properties of k-ary n-cubes
- Path embeddings in faulty 3-ary \(n\)-cubes
- Title not available (Why is that?)
- Matching preclusion for some interconnection networks
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- On \(k\)-ary \(n\)-cubes: Theory and applications.
Cited In (40)
- Conditional matching preclusion for the arrangement graphs
- Fractional matching preclusion number of graphs
- Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
- Fractional matching preclusion number of graphs and the perfect matching polytope
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- Clique matchings in the \(k\)-ary \(n\)-dimensional cube
- Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)
- On anti-Kekulé and \(s\)-restricted matching preclusion problems
- Strong matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for two-dimensional torus networks
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- Matching preclusion for vertex-transitive networks
- Strong matching preclusion for augmented cubes
- Strong matching preclusion for torus networks
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- Strong matching preclusion of \((n,k)\)-star graphs
- Conditional fault tolerance in a class of Cayley graphs
- Matching preclusion for direct product of regular graphs
- Matching preclusion for balanced hypercubes
- Strong matching preclusion for \(k\)-composition networks
- Matching preclusion number of graphs
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
- Matching preclusion for \(n\)-grid graphs
- The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs
- Strong matching preclusion under the conditional fault model
- Fractional matching preclusion of product networks
- Title not available (Why is that?)
- Matching preclusion and conditional matching preclusion for crossed cubes
- Matching preclusion for cube-connected cycles
- Matching preclusion for \(n\)-dimensional torus networks
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Fractional matching preclusion numbers of Cartesian product graphs
- The (conditional) matching preclusion for burnt pancake graphs
- Matching Preclusion for the Shuffle-Cubes
- Strong matching preclusion number of graphs
- Matching preclusion number in product graphs
- Strong matching preclusion for non-bipartite torus networks
This page was built for publication: 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 Q608299)
