%0 Journal Article
%T Perfect Matchings in Edge-Transitive Graphs
%J Iranian Journal of Mathematical Chemistry
%I University of Kashan
%Z 2228-6489
%A Marandi, A.
%A Nejah, A. H.
%A Behmaram, A.
%D 2014
%\ 12/01/2014
%V 5
%N Supplement 1
%P 27-33
%! Perfect Matchings in Edge-Transitive Graphs
%K perfect matching
%K Edge-transitive graph
%R 10.22052/ijmc.2014.7772
%X 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 end vertex in {u,v}.
%U https://ijmc.kashanu.ac.ir/article_7772_6c1386b641e42586265ac97c82fcede7.pdf