Pages that link to "Item:Q2446329"
From MaRDI portal
The following pages link to The (conditional) matching preclusion for burnt pancake graphs (Q2446329):
Displaying 18 items.
- Matching preclusion for vertex-transitive networks (Q290107) (← links)
- Strong matching preclusion for augmented cubes (Q387805) (← links)
- Strong matching preclusion of \((n,k)\)-star graphs (Q906391) (← links)
- Matching preclusion for \(n\)-grid graphs (Q1752462) (← links)
- Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\) (Q2012058) (← links)
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product (Q2028067) (← links)
- Neighbor connectivity of pancake graphs and burnt pancake graphs (Q2097164) (← links)
- Vulnerability analysis of multiprocessor system based on burnt pancake networks (Q2127635) (← links)
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs (Q2181218) (← links)
- Matching preclusion for direct product of regular graphs (Q2306600) (← links)
- Fractional matching preclusion number of graphs and the perfect matching polytope (Q2307510) (← links)
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model (Q2342670) (← links)
- Matching preclusion for cube-connected cycles (Q2352789) (← links)
- Matching preclusion for \(n\)-dimensional torus networks (Q2357377) (← links)
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs (Q2410255) (← links)
- Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults (Q2449066) (← links)
- Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract) (Q2695309) (← links)
- Paired 2-disjoint path covers of burnt pancake graphs with faulty elements (Q6138830) (← links)
