✦ LIBER ✦

Extremal Graphs With a Given Number of Perfect Matchings

✍ Scribed by Stephen G. Hartke; Derrick Stolee; Douglas B. West; Matthew Yancey

Book ID: 112121148
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 771 KB
Volume: 73
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21687

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Factor-Critical Graphs with Given Number

Factor-Critical Graphs with Given Number of Maximum Matchings

✍ Yan Liu; Guiying Yan 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 156 KB

Spectral radius of graphs with given mat

Spectral radius of graphs with given matching number

✍ Lihua Feng; Guihai Yu; Xiao-Dong Zhang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 117 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

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

The number of independent sets of unicyc

The number of independent sets of unicyclic graphs with given matching number

✍ Gong Chen; Zhongxun Zhu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 389 KB

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