Super edge-connectivity and matching preclusion of data center networks

zbMATH Open1417.05194arXiv1807.05224MaRDI QIDQ5226847FDOQ5226847

Authors: Huazhong Lü, Tingzeng Wu 

Publication date: 1 August 2019

Abstract: Edge-connectivity is a classic measure for reliability of a network in the presence of edge failures. $k$-restricted edge-connectivity is one of the refined indicators for fault tolerance of large networks. Matching preclusion and conditional matching preclusion are two important measures for the robustness of networks in edge fault scenario. In this paper, we show that the DCell network $D_{k,n}$ is super-$lambda$ for $kgeq2$ and $ngeq2$, super-$lambd{a}_2$ for $kgeq3$ and $ngeq2$, or $k=2$ and $n=2$, and super-$lambd{a}_3$ for $kgeq4$ and $ngeq3$. Moreover, as an application of $k$-restricted edge-connectivity, we study the matching preclusion number and conditional matching preclusion number, and characterize the corresponding optimal solutions of $D_{k,n}$. In particular, we have shown that $D_{1,n}$ is isomorphic to the $(n,k)$-star graph $S_{n+1,2}$ for $ngeq2$.

Full work available at URL: https://arxiv.org/abs/1807.05224

Recommendations

• The \(k\)-restricted edge-connectivity of the data center network DCell
• The restricted \(h\)-connectivity of the data center network DCell
• A note on the strong matching preclusion problem for data center networks
• On super and restricted connectivity of some interconnection networks.
• Conditional edge-fault-tolerant Hamiltonicity of the data center network

zbMATH Keywords

matching preclusionrestricted edge-connectivityconditional matching preclusiondata center network$(n,k)$-star graph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40)

Cited In (9)

• Fractional Matching Preclusion for Data Center Networks
• Fractional Matching Preclusion for Data Center Networks
• The restricted \(h\)-connectivity of the data center network DCell
• Two-disjoint-cycle-cover pancyclicity of data center networks
• On anti-Kekulé and \(s\)-restricted matching preclusion problems
• On edge connectivity and parity factor
• Component connectivity of the data center network dcell
• Relationship between extra edge connectivity and component edge connectivity for regular graphs
• A note on the strong matching preclusion problem for data center networks

This page was built for publication: Super edge-connectivity and matching preclusion of data center networks

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