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

On the Upper Bounds of the Numbers of Perfect Matchings in Graphs with Given Parameters

โœ Scribed by Hong Lin; Xiao-feng Guo

Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2007
Tongue
English
Weight
151 KB
Volume
23
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A sharp upper bound for the number of st
A sharp upper bound for the number of stable sets in graphs with given number of cut edges
โœ Hongbo Hua ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.

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

An upper bound on the number of cliques
An upper bound on the number of cliques in a graph
โœ Martin Farber; Mihรกly Hujter; Zsolt Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 252 KB ๐Ÿ‘ 1 views