Perfect Matchings in Edge-Transitive Graphs

Document Type : Conference Paper


1 University of Tehran

2 University of Tabriz


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}.


Main Subjects

Volume 5, Supplement 1
Extended Abstracts of the 6th Conference and Workshop on Mathematical Chemistry, Persian Gulf University, Bushehr, February 13 - 14, 2013 (Ed. M. Mogharrab)
December 2014
Pages 27-33