「hypercube」の共起表現一覧(1語右で並び替え)

hypercube

1語右で並び替え

該当件数:44件

  • of convex bodies are the Euclidean ball, the hypercube and the cross-polytope.
  • ept (member, primary item) participates in a hypercube and that all hypercubes are closed.
  • for the Weyl group; this corresponds to the hypercube and cross-polytope being different regular p
  • Monte Carlo and Latin hypercube are available for robustness analysis.
  • i's conjecture concerns the suitability of a hypercube as an network topology for communications.
  • Over the last 5 or 7 years, the magic hypercube community is starting to recognize an abbrev
  • eneral, for dimension d and order n, a magic hypercube consists of the numbers 1, 2, ..., nd, and h
  • not a direct proof that a square (or cube or hypercube) contains as many points as its side.
  • ystem involved an adaptation of a Riemannian hypercube data structure, invoking a helical spiral th
  • demihypercubes for being alternation of the hypercube family.
  • demihypercubes for being alternation of the hypercube family.
  • demihypercubes for being alternation of the hypercube family.
  • Nasik magic hypercube gives arguments for using {nasik} as synonym
  • Any hypercube graph
  • The hypercube graph Q4 as a unit distance graph.
  • Published in 1963, it is cospectral to the hypercube graph Q4.
  • e graph is an undirected graph formed from a hypercube graph by adding to it a perfect matching tha
  • graph, formed by replacing each vertex of a hypercube graph by a cycle.
  • The achromatic number of an n-dimensional hypercube graph is known to be proportional to , but t
  • e tree is a subgraph of a sufficiently large hypercube graph so a hypercube can be said to be a uni
  • , then for each v there exists a path in the hypercube graph from v to σ(v) such that no two paths
  • Any hypercube graph, such as the four-dimensional hypercub
  • The simplex graph of a complete graph is a hypercube graph, and the simplex graph of a cycle grap
  • A hypercube graph, in which the vertices correspond to a
  • rally opposed vertices of a four-dimensional hypercube graph.
  • The symmetries of hypercube graphs can be represented as signed permutat
  • induction and the inductive construction of hypercube graphs.
  • ding a long path as an induced subgraph of a hypercube has been particularly well-studied, and is c
  • ng each of the 2n facets of an n-dimensional hypercube into a box.
  • d include the hypercubes, every retract of a hypercube is a median graph.
  • The term unit cube or unit hypercube is also used to refer to hypercubes, or "cub
  • nding the longest possible induced path in a hypercube; it can be viewed as a special case of the i
  • Hypercube of n dimensions.
  • A magic hypercube of dimension n is perfect if all pan-n-agona
  • high-dimensional hypersphere, relative to a hypercube of the same width, tends to zero as dimensio
  • -the-box problem), a cycle cannot exist in a hypercube of dimension less than two.
  • The length of the longest diagonal of a unit hypercube of n dimensions is the square root of n.
  • an graph has many common properties with the hypercube Q4-both are Hamiltonian and have chromatic n
  • It is the same spectrum than the hypercube Q4.
  • It is a well known fact that every hypercube Qn is Hamiltonian for n > 1.
  • be scaled by an integer and embedded into a hypercube; this paper shows that for the metrics comin
  • ter as a nondecreasing mapping from the unit hypercube to the unit interval.
  • ow one chooses a permutation connecting each hypercube vertex to another vertex with which it shoul
  • The length of an r-agonal of a hypercube with side length a is .