The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
The analytic formula of the number of perfect matchings of two types of graphs
Author(s): 
Pages: 15-17
Year: Issue:  4
Journal: Acta Scientiarum Naturalium Universitatis Sunyatseni

Keyword:  perfect matchingladderlinear recurrence relationcharacteristic equation;
Abstract: Matching counting theory is an important part of graph theory and also a active research field. It has not only many applications background,and also the source of many important ideas developed during the rapid growth of combinatorics during the last several decades.But the problem of counting the number of perfect matchings for general graphs is NP-hard.By applying differentiation,summation and re-recursion calculation,several counting formulas of the perfect matchings for two specific types of graphs are given.By the method presented in this paper,the number of all perfect matchings of many graphs can be calculated.
Related Articles
No related articles found