A note on the strong matching preclusion problem for data center networks

DOI10.1016/j.ipl.2020.106007zbMath1462.68144MaRDI QIDQ2203600

Ping Han, Eddie Cheng, Yaping Mao, Tianlong Ma

Publication date: 7 October 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2020.106007

zbMATH Keywords

matching; fault tolerance; strong matching preclusion; data center network

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Fractional Matching Preclusion for Data Center Networks, Fractional Matching Preclusion for Data Center Networks

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
• Strong matching preclusion of \((n,k)\)-star graphs
• Conditional fault Hamiltonicity of the complete graph
• Conditional fault hamiltonian connectivity of the complete graph
• Conditional edge-fault-tolerant Hamiltonicity of the data center network
• Strong matching preclusion number of graphs
• Strong matching preclusion for \(k\)-composition networks
• The pessimistic diagnosability of data center networks
• The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
• Strong matching preclusion under the conditional fault model
• Strongly Menger connectedness of data center network and \((n,k)\)-star graph
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• Super edge-connectivity and matching preclusion of data center networks