A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a distributive lattice. It is natural to ask which lattices are MDLs. We show that if a plane bipartite graph $G$ is elementary, then ${\mathbf M}(G)$ is irreducible. Based on this result, a decomposition theorem on MDLs is obtained: a finite distributive lattice $\mathbf{L}$ is an MDL if and only if each factor in any cartesian product decomposition of $\mathbf{L}$ is an MDL. Two types of MDLs are presented: $J(\mathbf{m}\times \mathbf{n})$ and $J(\mathbf{T})$, where $\mathbf{m}\times \mathbf{n}$ denotes the cartesian product between $m$-element chain and $n$-element chain, and $\mathbf{T}$ is a poset implied by any orientation of a tree.Comment: 19 pages, 7 figure
A lucasene is a hexagon chain that is similar to a fibonaccene, an L-fence is a poset the Hasse diagram of which is isomorphic to the directed inner dual graph of the corresponding lucasene. A new class of cubes, which named after matchable Lucas cubes according to the number of its vertices (or elements), are a series of directed or undirected Hasse diagrams of filter lattices of L-fences. The basic properties and several classes of polynomials, e.g. rank generating functions, cube polynomials and degree sequence polynomials, of matchable Lucas cubes are obtained. Some special conclusions on binomial coefficients and Lucas triangle are given.A set P equipped with a binary relation ≤ satisfying reflexivity, antisymmetry and transitivity is said to be a partially ordered set (poset for short). Given any poset P , the dual P * of P is formed by defining x ≤ y to hold in P * if and only if y ≤ x holds in P . A subposet S of P is a chain if any two elements of S are comparable, and denoted by n if |S| = n [3]. Let x ≺ y denote y cover s x in P , i.e. x < y and. The set of all filters of a poset P is denoted by F (P ), and carries the usual anti-inclusion order, forms a finite distributive lattice [3,31] called filter lattice. For a finite lattice L, we denote by0 L (resp.1 L ) the minimum (resp. maximum) element in L.The symmetric difference of two finite sets A and B is defined asis a perfect matching of a graph and C is an M -alternating cycle of the graph, then the symmetric difference of M and edge-set E(C) is another perfect matching of the graph, which is simply denoted by M ⊕ C. Let G be a plane bipartite graph with a perfect matching, and the vertices of G are colored properly black and white such that the two ends of every edge receive different colors. An M -alternating cycle of G is said to be proper, if every edge of the cycle belonging to M goes from white end-vertex to black end-vertex by the clockwise orientation of the cycle; otherwise improper [43]. An inner face of a graph is called a cell if itsboundary is a cycle, and we will say that the cycle is a cell too. For some concepts and notations not explained in the paper, refer to [3,8,31] for poset and lattice, [1,11] for graph theory. Zhang and Zhang [45] extended the concept of Z-transformation graph of a hexagonal system to plane bipartite graphs. Definition 2.1 ([45]) Let G be a plane bipartite graph. The Z-transformation graph Z(G) is defined on M(G): M 1 , M 2 ∈ M(G) are joined by an edge if and only if M 1 ⊕ M 2 is a cell of G. And Z-transformation digraph Z(G) is the orientation of Z(G): an edge M 1 M 2 of Z(G) is oriented from M 1 to M 2 if M 1 ⊕ M 2 form a proper M 1 -alternating (thus improper M 2 -alternating) cell. Let G be a bipartite graph, from Theorem 4.1.1 in [21], we have that G is elementary if and only if G is connected and every edge of G lies in a perfect matching of G. Let G be a plane bipartite graph with a perfect matching, a binary relation ≤ on M(G) is defined as: for M 1 , M 2 ∈ M(G), M 1 ≤ M 2 if and only if Z(G) has a d...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.