Pages that link to "Item:Q1102985"
From MaRDI portal
The following pages link to A survey of the theory of hypercube graphs (Q1102985):
Displaying 50 items.
- Dimensionality of hypercube clusters (Q283200) (← links)
- Structure connectivity and substructure connectivity of hypercubes (Q284586) (← links)
- Sequential Monte Carlo for counting vertex covers in general graphs (Q294226) (← links)
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks (Q355511) (← links)
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q394540) (← links)
- Representation of finite graphs as difference graphs of \(S\)-units. I (Q406579) (← links)
- Note on the subgraph component polynomial (Q406698) (← links)
- Bipanconnectivity of faulty hypercubes with minimum degree (Q426602) (← links)
- Control of cancellations that restrain the growth of a binomial recursion (Q490769) (← links)
- Many-to-many disjoint paths in hypercubes with faulty vertices (Q516818) (← links)
- Nonlinear piecewise polynomial approximation and multivariate \(BV\) spaces of a Wiener-L. Young type. I. (Q526863) (← links)
- Analysis of discrete bioregulatory networks using symbolic steady states (Q542031) (← links)
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511) (← links)
- A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube (Q672019) (← links)
- Antipodal graphs and oriented matroids (Q686471) (← links)
- On crossing numbers of hypercubes and cube connected cycles (Q688627) (← links)
- Paired many-to-many disjoint path covers of hypertori (Q730480) (← links)
- Many-to-many disjoint paths in faulty hypercubes (Q730958) (← links)
- Paired many-to-many disjoint path covers of hypercubes with faulty edges (Q763493) (← links)
- Counting rooted spanning forests in cobordism of two circulant graphs (Q779138) (← links)
- Kolmogorov entropy for classes of convex functions (Q836088) (← links)
- Dense sets and embedding binary trees into hypercubes (Q869570) (← links)
- Integral graphs and \((k,\tau )\)-regular sets (Q962131) (← links)
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges (Q963441) (← links)
- Some results on topological properties of folded hypercubes (Q976130) (← links)
- On path bipancyclicity of hypercubes (Q987833) (← links)
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes (Q990111) (← links)
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- Cubical graphs and cubical dimensions (Q1102987) (← links)
- Cover-preserving order embeddings into Boolean lattices (Q1207716) (← links)
- Boolean layer cakes (Q1285779) (← links)
- Reverse binary graphs (Q1310229) (← links)
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs (Q1310233) (← links)
- Variations on a hypercube: Embellishments of parallel architectures (Q1310240) (← links)
- Visualizing Boolean operations on a hypercube (Q1344641) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- Counting spanning trees in cobordism of two circulant graphs (Q1615746) (← links)
- Random walks on binary strings applied to the somatic hypermutation of B-cells (Q1644684) (← links)
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes (Q1675872) (← links)
- The fault-diameter and wide-diameter of twisted hypercubes (Q1682889) (← links)
- Structure fault tolerance of hypercubes and folded hypercubes (Q1698727) (← links)
- Genus of the hypercube graph and real moment-angle complexes (Q1738954) (← links)
- Proper distance in edge-colored hypercubes (Q1740062) (← links)
- An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF) (Q1786864) (← links)
- Subgraphs of hypercubes and subdiagrams of Boolean lattices (Q1815849) (← links)
- A heuristic approach for constructing symmetric Gray codes (Q1883151) (← links)
- Extension of de Bruijn graph and Kautz graph (Q1903209) (← links)
- A characterization of cube-hypergraphs (Q1917484) (← links)
