Pages that link to "Item:Q608299"
From MaRDI portal
The following pages link to Matching preclusion for \(k\)-ary \(n\)-cubes (Q608299):
Displaying 41 items.
- Strong matching preclusion for \(n\)-dimensional torus networks (Q287442) (← links)
- Matching preclusion for vertex-transitive networks (Q290107) (← links)
- Strong matching preclusion for augmented cubes (Q387805) (← links)
- Strong matching preclusion for torus networks (Q391769) (← links)
- Matching preclusion and conditional matching preclusion for regular interconnection networks (Q442207) (← links)
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products (Q444435) (← links)
- Matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes (Q528780) (← links)
- Clique matchings in the \(k\)-ary \(n\)-dimensional cube (Q546220) (← links)
- Conditional matching preclusion for the arrangement graphs (Q653318) (← links)
- Strong matching preclusion of \((n,k)\)-star graphs (Q906391) (← links)
- Strong matching preclusion number of graphs (Q1694672) (← links)
- Strong matching preclusion for \(k\)-composition networks (Q1698726) (← links)
- Matching preclusion number of graphs (Q1711840) (← links)
- Matching preclusion number in product graphs (Q1725689) (← links)
- Matching preclusion for \(n\)-grid graphs (Q1752462) (← links)
- Matching preclusion for balanced hypercubes (Q1929236) (← links)
- Strong matching preclusion under the conditional fault model (Q1949116) (← 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)
- Fractional matching preclusion number of graphs (Q2078848) (← links)
- Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs (Q2101922) (← links)
- The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs (Q2165283) (← links)
- Fractional matching preclusion of product networks (Q2210501) (← links)
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph (Q2238215) (← links)
- Matching preclusion for direct product of regular graphs (Q2306600) (← links)
- Fractional matching preclusion number of graphs and the perfect matching polytope (Q2307510) (← links)
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube (Q2344732) (← links)
- Matching preclusion for cube-connected cycles (Q2352789) (← links)
- Matching preclusion for \(n\)-dimensional torus networks (Q2357377) (← links)
- Strong matching preclusion for non-bipartite torus networks (Q2402268) (← links)
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs (Q2410255) (← links)
- The (conditional) matching preclusion for burnt pancake graphs (Q2446329) (← links)
- Strong matching preclusion for \(k\)-ary \(n\)-cubes (Q2446897) (← links)
- Conditional fault tolerance in a class of Cayley graphs (Q2804867) (← links)
- (Q3110074) (← links)
- MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES (Q3144934) (← links)
- Matching Preclusion for the Shuffle-Cubes (Q5087016) (← links)
- Strong matching preclusion for two-dimensional torus networks (Q5259052) (← links)
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS (Q5408359) (← links)
- On anti-Kekulé and \(s\)-restricted matching preclusion problems (Q6039537) (← links)
- Fractional matching preclusion numbers of Cartesian product graphs (Q6110597) (← links)