Fractional matching preclusion for data center networks
From MaRDI portal
Publication:5087091
DOI10.1142/S0129626421500122zbMATH Open1490.68170OpenAlexW4205967742MaRDI QIDQ5087091FDOQ5087091
Authors:
Publication date: 8 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626421500122
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- The restricted \(h\)-connectivity of the data center network DCell
- Super edge-connectivity and matching preclusion of data center networks
- A new class of interconnection networks based on the alternating group
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong matching preclusion for augmented cubes
- Matching preclusion for some interconnection networks
- Strong matching preclusion
- Conditional matching preclusion sets
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- Fractional matching preclusion of graphs
- Fractional matching preclusion for arrangement graphs
- Fractional matching preclusion for \((n,k)\)-star graphs
- A note on the strong matching preclusion problem for data center networks
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)
