✦ LIBER ✦

New Lower Bound on the Number of Perfect Matchings in Fullerene Graphs

✍ Scribed by Heping Zhang; Fuji Zhang

Book ID: 110333860
Publisher: Springer
Year: 2001
Tongue: English
Weight: 77 KB
Volume: 30
Category: Article
ISSN: 0259-9791
DOI: 10.1023/a:1015131912706

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On lower bounds of number of perfect mat

On lower bounds of number of perfect matchings in fullerene graphs

✍ Tomislav Došlić 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 46 KB

A superlinear bound on the number of per

A superlinear bound on the number of perfect matchings in cubic bridgeless graphs

✍ Louis Esperet; František Kardoš; Daniel Král’ 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 482 KB

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

A new lower bound on the independence nu

A new lower bound on the independence number of graphs

✍ Angel, Eric; Campigotto, Romain; Laforest, Christian 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 228 KB

On the Upper Bounds of the Numbers of Pe

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

✍ Hong Lin; Xiao-feng Guo 📂 Article 📅 2007 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 151 KB

On the Number of Perfect Matchings in a

On the Number of Perfect Matchings in a Bipartite Graph

✍ de Carvalho, Marcelo H.; Lucchesi, Cláudio L.; Murty, U. S. R. 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 471 KB