University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 5 Supplement 1 2014 12 01 Perfect Matchings in Edge-Transitive Graphs 27 33 7772 10.22052/ijmc.2014.7772 EN A. Marandi University of Tehran A. H. Nejah University of Tehran A. Behmaram University of Tabriz Journal Article 2013 12 04 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}. https://ijmc.kashanu.ac.ir/article_7772_6c1386b641e42586265ac97c82fcede7.pdf