Hasse diagram


Also found in: Wikipedia.

Hasse diagram

[′häs·ə ‚dī·ə‚gram]
(mathematics)
A representation of a partially ordered set as a directed graph, in which elements of the set are represented by vertices of the graph, and there is a directed arc from x to y if and only if y covers x.
References in periodicals archive ?
S(P), [intersection]} be the pure neutrosophic semilattice whose Hasse diagram is as follows.
3] is depicted in Figure 3; for instance, there are two arrows from the bottom to the top since there are three connected components in the Hasse diagram of the R-order on [F.
They used the fact that an initial interval [Id, [sigma]] is the set of linear extensions of a partially ordered set whose Hasse diagram is a tree when [sigma] avoids 1324 and [bar.
Puppe (for example see [8]), we can see a Hasse diagram of the cohomology algebras of the fixed point sets of circle actions on X, which are correspond to the rationalized Borel spaces, from a point of view of a deformation.
A Hasse diagram of a poset can be a line graph of the original graph, i.
We in case of Neutrosophic lattices represent them by the diagram which will be known as the neutrosophic Hasse diagram.
n] and is the poset which has Hasse diagram depicted in Figure 1.
Consequently, there is a one-to-one correspondence between preposets and acyclic oriented graphs on subsets of V whose vertices partition V: a preposet R corresponds to the Hasse diagram of the poset [<.
The Hasse diagram of this poset is the usual graph of reduced galleries.
Suppose that there is a cycle in the Hasse diagram of [V.
Indeed, when the increasing flip graph is the Hasse diagram of the increasing flip poset, this poset is EL-shellable, and we can compute its Mobius function.
r], that is, r copies of the Hasse diagram of the Young lattice.