✦ LIBER ✦

Counting perfect matchings in hexagonal chains

✍ Scribed by Peter E. John

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 265 KB
Volume: 196
Category: Article
ISSN: 0009-2614
DOI: 10.1016/0009-2614(92)85731-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Z-transformation graphs of perfect match

Z-transformation graphs of perfect matchings of hexagonal systems

✍ Zhang Fu-ji; Guo Xiao-feng; Chen Rong-si 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Counting Matchings in Graphs

✍ E.J. Farrell 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A general formula is derivedfor the matching polynomial of an arbitrary graph G. This yields a methodfor counting matchings in graphs. From the general formula, explicit formulae are deducedfor the number of k-matchings in several well-known families of graphs.

Perfect fractional matchings in random h

Perfect fractional matchings in random hypergraphs

✍ Michael Krivelevich 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 890 KB

Given an r-uniform hypergraph H = (V, E ) on ( V ( = n vertices, a real-valued function f(e) 5 1 for all u E V and C e E E f(e) = n/r. Considering a random r-uniform hypergraph process of n vertices, we show that with probability tending to 1 as n + m , at the very moment to when the last isolated

Special parity of perfect matchings in b

Special parity of perfect matchings in bipartite graphs

✍ Ron Aharoni; Rachel Manber; Bronislaw Wajnryb 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Let G be a bipartite graph in which every edge belongs to some perfect matching, and let D be a subset of its edge set. It is shown that M fl D has the same parity for every perfect matching M if and only if D is a cut, and equivalently if and only. if (G, D) is a balanced signed-graph. This gives n

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

Finding all the perfect matchings in bip

Finding all the perfect matchings in bipartite graphs

✍ K. Fukuda; T. Matsui 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 283 KB