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

On the Ordering of a Class of Graphs with Respect to their Matching Numbers

โœ Scribed by Xiaoxia Wang; Xiaofeng Guo


Publisher
Springer
Year
2006
Tongue
English
Weight
122 KB
Volume
42
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A note on the number of perfect matching
โœ 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