Strong matching preclusion for augmented cubes

DOI10.1016/J.TCS.2013.05.002MaRDI QIDQ387805zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

augmented cubesinterconnection networksperfect matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)

Recommendations

• The conditional strong matching preclusion of augmented cubes
• Strong matching preclusion
• Fractional matching preclusion for generalized augmented cubes
• Strong matching preclusion number of graphs
• Strong matching preclusion of (n,k)-star graphs

Cites work

• Augmented cubes
• Conditional edge-fault Hamiltonicity of augmented cubes
• Conditional matching preclusion for hypercube-like interconnection networks
• Conditional matching preclusion for the arrangement graphs
• Conditional matching preclusion sets
• Cycle embedding of augmented cubes
• Graph theory and interconnection networks.
• scientific article; zbMATH DE number 5016662 (Why is no real title available?)
• Hyper Hamiltonian laceability on edge fault star graph
• 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
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion and conditional matching preclusion problems for twisted cubes
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Matching preclusion for balanced hypercubes
• Matching preclusion for some interconnection networks
• Strong matching preclusion
• The (conditional) matching preclusion for burnt pancake graphs
• The super connectivity of augmented cubes

Cited in

(26)

• Strong matching preclusion number of graphs
• Strong matching preclusion for \(k\)-composition networks
• A note on the strong matching preclusion problem for data center networks
• Matching preclusion for cube-connected cycles
• Strong matching preclusion for non-bipartite torus networks
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
• Strong matching preclusion of 2-matching composition networks
• Strong matching preclusion for \(n\)-dimensional torus networks
• scientific article; zbMATH DE number 6000733 (Why is no real title available?)
• Strong matching preclusion of the generalized Petersen graph
• The conditional strong matching preclusion of augmented cubes
• Matching Preclusion for the Shuffle-Cubes
• A short note of strong matching preclusion for a class of arrangement graphs
• Fractional matching preclusion for data center networks
• Fractional Strong Matching Preclusion for DHcube
• Fractional matching preclusion for data center networks
• Fractional matching preclusion for (n,k)-star graphs
• Fractional matching preclusion for radix triangular mesh
• Fractional strong matching preclusion for two variants of hypercubes
• Conditional strong matching preclusion of the alternating group graph
• Strong matching preclusion for two-dimensional torus networks
• The restricted edge-connectivity and restricted connectivity of augmented k-ary n-cubes
• Integer \(k\)-matching preclusion of some interconnection networks
• Strong matching preclusion
• Strong matching preclusion for folded hypercubes

Describes a project that uses

Uses Software

• NetworkX

This page was built for publication: Strong matching preclusion for augmented cubes

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