University of KashanIranian Journal of Mathematical Chemistry2228-64895Supplement 120141201Perfect Matchings in Edge-Transitive Graphs2733777210.22052/ijmc.2014.7772ENA.MarandiUniversity of TehranA. H.NejahUniversity of TehranA.BehmaramUniversity of TabrizJournal Article20131204We 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