Matching preclusion for cube-connected cycles
From MaRDI portal
Publication:2352789
DOI10.1016/j.dam.2015.04.001zbMath1316.05100OpenAlexW339117681MaRDI QIDQ2352789
Haiyuan Yao, Qiuli Li, Wai Chee Shiu
Publication date: 6 July 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.04.001
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (10)
Strong matching preclusion for \(n\)-dimensional torus networks ⋮ The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs ⋮ On anti-Kekulé and \(s\)-restricted matching preclusion problems ⋮ Fractional matching preclusion numbers of Cartesian product graphs ⋮ The fractional (strong) matching preclusion number of complete \(k\)-partite graph ⋮ Conditional matching preclusion for regular bipartite graphs and their Cartesian product ⋮ Matching preclusion for direct product of regular graphs ⋮ Fractional matching preclusion number of graphs and the perfect matching polytope ⋮ Matching preclusion for \(n\)-dimensional torus networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The diameter of the cube-connected cycles
- Super cyclically edge connected transitive graphs
- 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
- On the pagenumber of the cube-connected cycles
- Conditional matching preclusion for the arrangement graphs
- On crossing numbers of hypercubes and cube connected cycles
- Conditional matching preclusion sets
- Conditional matching preclusion for hypercube-like interconnection networks
- Matching theory
- Cycles in the cube-connected cycles graph
- Optimally super-edge-connected transitive graphs
- Matching preclusion for balanced hypercubes
- The (conditional) matching preclusion for burnt pancake graphs
- On k-factor-critical graphs
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
- Conditional matching preclusion for the alternating group graphs and split-stars
- Matching preclusion for the (n, k)-bubble-sort graphs
- A group-theoretic model for symmetric interconnection networks
- Embedding cube-connected cycles graphs into faulty hypercubes
- On Representatives of Subsets
- Matching preclusion for some interconnection networks
This page was built for publication: Matching preclusion for cube-connected cycles
