Fractional strong matching preclusion for two variants of hypercubes
DOI10.20429/TAG.2019.060202zbMATH Open1429.05162OpenAlexW2976373125MaRDI QIDQ5205657FDOQ5205657
Authors: Huifen Ge, Tianlong Ma, Miaolin Wu, Yuzhi Xiao
Publication date: 13 December 2019
Published in: Theory and Applications of Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.20429/tag.2019.060202
Recommendations
- Fractional Strong Matching Preclusion for DHcube
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Fractional matching preclusion for crossed cubes
- On the fractional matching polytope of a hypergraph
- Strong matching preclusion for augmented cubes
- Fractional matching preclusion for generalized augmented cubes
- Fractional matchings in hypergraphs
- Fractional matching preclusion of the restricted HL-graphs
- Matching preclusion for balanced hypercubes
- Fractional matching preclusion for arrangement graphs
locally twisted cubefractional perfect matchingfractional matching preclusionfractional strong matching preclusionmultiply twisted cube
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cited In (6)
- Fractional matching preclusion of graphs
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- Fractional matching preclusion for generalized augmented cubes
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Fractional Strong Matching Preclusion for DHcube
- Fractional matching preclusion for crossed cubes
This page was built for publication: Fractional strong matching preclusion for two variants of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205657)