Примеры использования Partial cube на Английском языке и их переводы на Русский язык
{-}
-
Official
-
Colloquial
Every tree is a partial cube.
An embedding of a partial cube onto a hypercube of this dimension is unique, up to symmetries of the hypercube.
Every such graph is a partial cube.
Other types of dimension of partial cubes have also been defined, based on embeddings into more specialized structures.
All median graphs are partial cubes.
A partial cube in which every vertex has exactly three neighbors is known as a cubic partial cube.
It is the only known nonplanar cubic partial cube.
Many of the theorems about partial cubes are based directly or indirectly upon a certain binary relation defined on the edges of the graph.
The n-gonal prism graphs for even values of n are partial cubes.
The set of strong orientations of a graph forms a partial cube, with adjacent orientations in this structure differing in the orientation of a single edge.
Convex subgraphs play an important role in the theory of partial cubes and median graphs.
Winkler showed that a connected graph is a partial cube if and only if it is bipartite and the relation Θ{\displaystyle\Theta} is transitive.
The planar dual graph of an arrangement of lines in the Euclidean plane is a partial cube.
The Cartesian product of any finite set of partial cubes is another partial cube.
In particular, median graphs are isometric subgraphs of hypercubes, andare therefore partial cubes.
Every hypercube graph is itself a partial cube, which can be labeled with all the different bitstrings of length equal to the dimension of the hypercube.
Thus, the rhombille tiling can be viewed as an example of an infinite unit distance graph and partial cube.
Partial cubes can be recognized, and a Hamming labeling constructed, in O( n 2){\displaystyle O(n^{2})} time, where n{\displaystyle n} is the number of vertices in the graph.
Such a labeling is called a Hamming labeling;it represents an isometric embedding of the partial cube into a hypercube.
They form one of the few known infinite families of cubic partial cubes, and(except for four sporadic examples)the only vertex-transitive cubic partial cubes.
Therefore, like other simplex graphs, Fibonacci cubes are median graphs andmore generally partial cubes.
The set of all acyclic orientations of a given graph may be given the structure of a partial cube, in which two acyclic orientations are adjacent whenever they differ in the direction of a single edge.
The graphs that admit such embeddings were characterized by Djoković(1973) and Winkler(1984), andwere later named partial cubes.
The isometric dimension of a partial cube is the minimum dimension of a hypercube onto which it may be isometrically embedded, and is equal to the number of equivalence classes of the Djoković-Winkler relation.
Dual graphs of simplicial arrangements have been used to construct infinite families of 3-regular partial cubes, isomorphic to the graphs of simple zonohedra.
The underlying graph of any antimatroid, having a vertex for each set in the antimatroid and an edge for every two sets that differ by a single element,is always a partial cube.
Although several infinite families of cubic partial cubes are known, together with many other sporadic examples,the only known cubic partial cube that is not a planar graph is the Desargues graph.
Since the median graphs include the squaregraphs, simplex graphs, and Fibonacci cubes, as well as the covering graphs of finite distributive lattices,these are all partial cubes.
Equivalently, a partial cube is a graph whose vertices can be labeled with bit strings of equal length in such a way that the distance between two vertices in the graph is equal to the Hamming distance between their labels.
It is named after Girard Desargues, arises from several different combinatorial constructions, has a high level of symmetry,is the only known non-planar cubic partial cube, and has been applied in chemical databases.