Name
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 that has neither perfect matchings nor almost perfect matchings. In 14, Wang et al. proved that C k ź ź ź C k is super strongly matched, where k ( ź 3 ) is odd. In this paper, we show that C k 1 ź C k 2 ź ź ź C k n is super strongly matched, where n ( ź 3 ) is an integer and k i ( ź 3 ) is an odd integer for each i ź 1 , n . Our studies generalize the results of Wang et al. 14. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.tcs.2016.05.008 | Theor. Comput. Sci. |
Keywords | Field | DocType |
Strong matching preclusion,Almost perfect matching,Perfect matching,Torus networks | Integer,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Matching preclusion,Matching (graph theory),Torus,Mathematics | Journal |
Volume | Issue | ISSN |
635 | C | 0304-3975 |
Citations | PageRank | References |
1 | 0.37 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaomin Hu | 1 | 3 | 2.09 |
| Yingzhi Tian | 2 | 20 | 9.28 |
| Xiaodong Liang | 3 | 30 | 21.59 |
| Jixiang Meng | 4 | 353 | 55.62 |