Fractional Matching Preclusion for Data Center Networks

DOI10.1142/S0129626421500122zbMath1490.68170OpenAlexW4205967742MaRDI QIDQ5087091

No author found.

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

zbMATH Keywords

matchingdata center networksfractional matching preclusionfractional strong matching preclusion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The restricted \(h\)-connectivity of the data center network DCell
• Strong matching preclusion for augmented cubes
• Strong matching preclusion
• Conditional matching preclusion sets
• A note on the strong matching preclusion problem for data center networks
• Fractional matching preclusion for arrangement graphs
• Fractional matching preclusion of graphs
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Fractional Matching Preclusion for (n,k)-Star Graphs
• Super edge-connectivity and matching preclusion of data center networks
• A new class of interconnection networks based on the alternating group
• Matching preclusion for some interconnection networks

This page was built for publication: Fractional Matching Preclusion for Data Center Networks