The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The class of data center networks has been proposed as a good class of models in the design of computer networks. Such a data center network can be viewed as a server-centric interconnection network structure, which can support millions of servers with high network capacity that uses only commodity switches. In this paper, we determine the strong matching preclusion number of k-dimensional data center networks with n-port switches and $t_{k,n}$ servers for $k\ge 0$ and $n\ge 2$. In addition, optimal strong matching preclusion sets of these graphs are categorized.

图的强匹配排除数是顶点和边的最小数目，这些顶点和边的删除会导致图既没有完美匹配也几乎没有完美匹配的图。在计算机网络的设计中，已经提出了数据中心网络的类别作为良好的模型类别。这样的数据中心网络可以看作是一个以服务器为中心的互连网络结构，可以支持仅使用商用交换机的数百万台具有高网络容量的服务器。在本文中，我们确定具有n个端口交换机的k维数据中心网络的强匹配排除数。${Ť}_{ķ，ñ}$ 用于的服务器 $ķ\ge 0$ 和 $ñ\ge 2$。此外，对这些图的最佳强匹配排除集进行了分类。