Strong matching preclusion for augmented cubes
From MaRDI portal
Publication:387805
DOI10.1016/j.tcs.2013.05.002zbMath1278.05187OpenAlexW2020288150MaRDI QIDQ387805
Eddie Cheng, Shalin Shah, Vyom Shah, Daniel E. Steffy
Publication date: 17 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.002
Extremal problems in graph theory (05C35) Network design and communication in computer systems (68M10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (14)
Strong matching preclusion for \(n\)-dimensional torus networks ⋮ Strong matching preclusion for non-bipartite torus networks ⋮ Fractional Matching Preclusion for Data Center Networks ⋮ Fractional Matching Preclusion for Data Center Networks ⋮ Fractional Matching Preclusion for (n,k)-Star Graphs ⋮ Strong matching preclusion number of graphs ⋮ Strong matching preclusion for \(k\)-composition networks ⋮ Integer \(k\)-matching preclusion of some interconnection networks ⋮ A note on the strong matching preclusion problem for data center networks ⋮ Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract) ⋮ Strong matching preclusion for \(k\)-ary \(n\)-cubes ⋮ The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes ⋮ Fractional matching preclusion for radix triangular mesh ⋮ Strong matching preclusion for two-dimensional torus networks
Uses Software
Cites Work
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Conditional matching preclusion for the arrangement graphs
- Strong matching preclusion
- Hyper Hamiltonian laceability on edge fault star graph
- The super connectivity of augmented cubes
- Conditional edge-fault Hamiltonicity of augmented cubes
- Cycle embedding of augmented cubes
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Matching preclusion for balanced hypercubes
- The (conditional) matching preclusion for burnt pancake graphs
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
- Augmented cubes
- Matching preclusion for some interconnection networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strong matching preclusion for augmented cubes