Pages that link to "Item:Q2913948"
From MaRDI portal
The following pages link to Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars (Q2913948):
Displayed 18 items.
- Matching preclusion for vertex-transitive networks (Q290107) (← links)
- Strong matching preclusion for augmented cubes (Q387805) (← links)
- Matching preclusion and conditional matching preclusion for regular interconnection networks (Q442207) (← links)
- One-to-many node-disjoint paths of hyper-star networks (Q442216) (← links)
- Strong matching preclusion of \((n,k)\)-star graphs (Q906391) (← links)
- Strong matching preclusion number of graphs (Q1694672) (← links)
- Matching preclusion number of graphs (Q1711840) (← links)
- Matching preclusion number in product graphs (Q1725689) (← links)
- Matching preclusion for \(n\)-grid graphs (Q1752462) (← links)
- Fractional matching preclusion number of graphs (Q2078848) (← links)
- The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs (Q2165283) (← links)
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph (Q2238215) (← links)
- A note on generalized matching preclusion in bipartite graphs (Q2272412) (← links)
- Fractional matching preclusion number of graphs and the perfect matching polytope (Q2307510) (← links)
- Matching preclusion for cube-connected cycles (Q2352789) (← links)
- The (conditional) matching preclusion for burnt pancake graphs (Q2446329) (← links)
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS (Q5408359) (← links)
- Fractional matching preclusion numbers of Cartesian product graphs (Q6110597) (← links)