| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6875642 | Theoretical Computer Science | 2018 | 8 Pages |
Abstract
The strong matching preclusion number of a graph is the minimum number of edges and/or vertices whose deletion results in the remaining graph has neither perfect matchings nor almost perfect matchings. In this paper, we study the strong matching preclusion number and strong matching preclusion sets for k-composition networks with odd order. Our results generalize the main conclusion in [12].
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng,