Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)
From MaRDI portal
Publication:2012058
DOI10.1016/j.dam.2017.06.001zbMath1367.05169OpenAlexW2725755126MaRDI QIDQ2012058
Bin Zhao, Yingzhi Tian, Xiao-Min Hu, Ji Xiang Meng
Publication date: 27 July 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.06.001
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Conditional matching preclusion sets
- Matching preclusion for balanced hypercubes
- The (conditional) matching preclusion for burnt pancake graphs