Fractional Strong Matching Preclusion for DHcube

DOI10.1142/S0129626421500018zbMath1490.05223OpenAlexW3131586790MaRDI QIDQ5087081

No author found.

Publication date: 8 July 2022

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626421500018

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

The fractional (strong) matching preclusion number of complete \(k\)-partite graph

Cites Work

• Unnamed Item
• Unnamed Item
• DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph
• KCube: a novel architecture for interconnection networks
• Strong matching preclusion
• Conditional matching preclusion sets
• Hamiltonian properties of some compound networks
• Matching preclusion for balanced hypercubes
• Fractional matching preclusion for arrangement graphs
• Fractional matching preclusion of graphs
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• The Mobius cubes
• Fractional Matching Preclusion for (n,k)-Star Graphs
• A new class of interconnection networks based on the alternating group
• Matching preclusion for some interconnection networks
• The NP-completeness column: An ongoing guide

This page was built for publication: Fractional Strong Matching Preclusion for DHcube