Conditional matching preclusion number of graphs
From MaRDI portal
Cites work
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Conditional matching preclusion for the alternating group graphs and Split-stars
- Conditional matching preclusion for the arrangement graphs
- Conditional matching preclusion sets
- Fractional matching preclusion of graphs
- Graph theory
- scientific article; zbMATH DE number 5016662 (Why is no real title available?)
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Matching preclusion for some interconnection networks
- Matching preclusion number in product graphs
- Strong matching preclusion
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Strong matching preclusion number of graphs
- Strong matching preclusion under the conditional fault model
- The Mobius cubes
Cited in
(7)- Matching preclusion number of graphs
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
- The (conditional) matching preclusion for burnt pancake graphs
- Conditional matching preclusion for the star graphs.
- scientific article; zbMATH DE number 5919743 (Why is no real title available?)
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
- Some sufficient conditions for a graph to be strong star factor
This page was built for publication: Conditional matching preclusion number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6045913)