๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Direct Sum of Distributive Lattices on the Perfect Matchings of a Plane Bipartite Graph

โœ Scribed by Heping Zhang

Publisher
Springer Netherlands
Year
2010
Tongue
English
Weight
405 KB
Volume
27
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The rotation graphs of perfect matchings
The rotation graphs of perfect matchings of plane bipartite graphs
โœ Heping Zhang; Fuji Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 517 KB

In the present paper, the minimal proper alternating cycle (MPAC) rotation graph R(G) of perfect matchings of a plane bipartite graph G is defined. We show that an MPAC rotation graph R(G) of G is a directed rooted tree, and thus extend such a result for generalized polyhex graphs to arbitrary plane

A note on the number of perfect matching
A note on the number of perfect matchings of bipartite graphs
โœ Zhang Fuji; Zhang Heping ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 484 KB

Let G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perfect matchings. For plane bipartite graphs each interior face of which is surrounded by a circuit of length 4s + 2, s E { 1,2,. . .}, an elegant formula, i.e. det A = (-1 )nK2, had been rigorously proved by Cv