Perfect Matchings in Edge-Transitive Graphs
نویسندگان
1 University of Tehran
2 University of Tabriz
3 University of Tehran
doi
10.22052/ijmc.2014.7772چکیده
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}.
