Graphical condensation of plane graphs: a combinatorial approach

Details Graphical condensation of plane graphs: a combinatorial approach Graphical condensation of plane graphs: a combinatorial approach

2005-09-15

arxiv.org/abs/math/0509337v2

Mathematics

Combinatorics

13 pages, 5 figures. accepted by Theoretial Computer Science

Scientific paper

The method of graphical vertex-condensation for enumerating perfect matchings of plane bipartite graph was found by Propp (Theoret. Comput. Sci. 303(2003), 267-301), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004), 29-57) and Yan and Zhang (J. Combin. Theory Ser. A, 110(2005), 113-125). In this paper, by a purely combinatorial method some explicit identities on graphical vertex-condensation for enumerating perfect matchings of plane graphs (which do not need to be bipartite) are obtained. As applications of our results, some results on graphical edge-condensation for enumerating perfect matchings are proved, and we count the sum of weights of perfect matchings of weighted Aztec diamond.

Affiliated with

Also associated with

No associations

Rating

Graphical condensation of plane graphs: a combinatorial approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphical condensation of plane graphs: a combinatorial approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphical condensation of plane graphs: a combinatorial approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-407403