Strong matching preclusion for folded hypercubes

DOI10.1016/J.DAM.2025.08.045MaRDI QIDQ6906712zbMATH OpenFDO

Authors Zhicheng Lin, Ruizhi Lin

Publication date 4 November 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.08.045

zbMATH Keywords

folded hypercubematching preclusionstrong matching preclusion

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Cycles in folded hypercubes
• Edge-fault-tolerant properties of hypercubes and folded hypercubes
• Fault-free cycles in folded hypercubes with more faulty elements
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• scientific article; zbMATH DE number 5016662 (Why is no real title available?)
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Matching preclusion for \(n\)-dimensional torus networks
• Matching preclusion for balanced hypercubes
• Matching preclusion for cube-connected cycles
• Matching preclusion for vertex-transitive networks
• Matching preclusion number in product graphs
• Matching preclusion number of graphs
• On reliability of the folded hypercubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Some edge‐fault‐tolerant properties of the folded hypercube
• Strong matching preclusion
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion for \(k\)-composition networks
• Strong matching preclusion for \(n\)-dimensional torus networks
• Strong matching preclusion for augmented cubes
• Strong matching preclusion for torus networks
• Strong matching preclusion for two-dimensional torus networks
• Strong matching preclusion number of graphs
• Strong matching preclusion of (n,k)-star graphs
• The (conditional) matching preclusion for burnt pancake graphs

This page was built for publication: Strong matching preclusion for folded hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906712)