Upper Bounds for Perfect Matchings in Pfaffian and Planar Graphs
نویسندگان
چکیده
We give upper bounds on weighted perfect matchings in Pfaffian graphs. These upper bounds are better than generalized Bregman’s inequality. We show that some of our upper bounds are sharp for 3 and 4-regular Pfaffian graphs. We apply our results to fullerene graphs.
منابع مشابه
Pfaffian Orientation and Enumeration of Perfect Matchings for some Cartesian Products of Graphs
The importance of Pfaffian orientations stems from the fact that if a graph G is Pfaffian, then the number of perfect matchings of G (as well as other related problems) can be computed in polynomial time. Although there are many equivalent conditions for the existence of a Pfaffian orientation of a graph, this property is not well-characterized. The problem is that no polynomial algorithm is kn...
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملCounting perfect matchings in graphs that exclude a single-crossing minor
A graph H is single-crossing if it can be drawn in the plane with at most one crossing. For any single-crossing graph H, we give an O(n4) time algorithm for counting perfect matchings in graphs excluding H as a minor. The runtime can be lowered to O(n1.5) when G excludes K5 or K3,3 as a minor. This is the first generalization of an algorithm for counting perfect matchings in K3,3free graphs (Li...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملCompatible Matchings for Bichromatic Plane Straight-line Graphs
Two plane graphs with the same vertex set are compatible if their union is again a plane graph. We consider bichromatic plane straight-line graphs with vertex set S consisting of the same number of red and blue points, and (perfect) matchings which are compatible to them. For several different classes C of graphs, we present lower and upper bounds such that any given graph G(S) ∈ C admits a com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013