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

The number of matchings of low order in hexagonal systems

โœ Scribed by D. Klabjan; B. Mohar

Book ID
108316179
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
335 KB
Volume
186
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hamilton paths in Z-transformation graph
Hamilton paths in Z-transformation graphs of perfect matchings of hexagonal systems
โœ Rong-si Chen; Fu-ji Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 371 KB

Let H be a hexagonal system. The Z-transformation graph Z(H) is the graph where the vertices are the perfect matchings of H and where two perfect matchings are joined by an edge provided their symmetric difference is a hexagon of H (Z. Fu-ji et al., 1988). In this paper we prove that Z(H) has a Hami

The number of maximum matchings in a tre
The number of maximum matchings in a tree
โœ Clemens Heuberger; Stephan Wagner ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 700 KB
The number of perfect matchings in a hyp
The number of perfect matchings in a hypercube
โœ Niall Graham; Frank Harary ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 243 KB

A perfect matching or a l-factor of a graph G is a spanning subgraph that is regular of degree one. Hence a perfect matching is a set of independent edges which matches all the nodes of G in pairs. Thus in a hypercube parallel processor, the number of perfect matchings evaluates the number of diff