Author:
Behmaram Afshin,Friedland Shmuel
Abstract
We give upper bounds on weighted perfect matchings in Pfaffian graphs. These upper bounds are better than Bregman's upper bounds on the number of perfect matchings. We show that some of our upper bounds are sharp for 3 and 4-regular Pfaffian graphs. We apply our results to fullerene graphs.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献