Fractional matching preclusion for data center networks
From MaRDI portal
(Redirected from Publication:5087091)
Fractional matching preclusion for data center networks (scientific article; zbMATH DE number 7554714)
Fractional matching preclusion for data center networks (scientific article; zbMATH DE number 7554714)
Recommendations
Cites work
- A new class of interconnection networks based on the alternating group
- A note on the strong matching preclusion problem for data center networks
- Conditional matching preclusion sets
- Fractional matching preclusion for (n,k)-star graphs
- Fractional matching preclusion for arrangement graphs
- Fractional matching preclusion of graphs
- Graph theory
- scientific article; zbMATH DE number 5016662 (Why is no real title available?)
- scientific article; zbMATH DE number 1131873 (Why is no real title available?)
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- Matching preclusion for some interconnection networks
- Strong matching preclusion
- Strong matching preclusion for augmented cubes
- Super edge-connectivity and matching preclusion of data center networks
- The restricted h-connectivity of the data center network DCell
Cited in
(3)
This page was built for publication: Fractional matching preclusion for data center networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087091)