期刊
COMPUTER JOURNAL
卷 65, 期 7, 页码 1874-1890出版社
OXFORD UNIV PRESS
DOI: 10.1093/comjnl/bxab029
关键词
interconnection network; matching preclusion; enhanced hypercube
类别
资金
- National Natural Science Foundation of China [61772010]
This paper investigates the matching preclusion number and the strong matching preclusion number of the enhanced hypercube, providing specific values for each.
The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves the resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings. The (conditional) strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion makes the resulting graph (with no isolated vertices) without perfect matching or almost perfect matching. The enhanced hypercube Q(n,k) (1 <= k <= n - 1) is an extension of hypercube. In this paper, we prove that the matching preclusion number of Q(n,k) is n + 1 (1 <= k <= n- 1), the strong matching preclusion number of Q(n,k) is n +1 (2 <= k <= n-1), the conditional matching preclusion number of Qn, n-1 is 2n- 1, the conditional matching preclusion number of Q(n,k) is 2n (1 <= k <= n - 2) and the conditional strong matching preclusion number of Q(n,n)-2 is 2n - 3 (n >= 4).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据