TY - JOUR
ID - 7772
TI - Perfect Matchings in Edge-Transitive Graphs
JO - Iranian Journal of Mathematical Chemistry
JA - IJMC
LA - en
SN - 2228-6489
AU - Marandi, A.
AU - Nejah, A. H.
AU - Behmaram, A.
AD - University of Tehran
AD - University of Tabriz
Y1 - 2014
PY - 2014
VL - 5
IS - Supplement 1
SP - 27
EP - 33
KW - perfect matching
KW - Edge-transitive graph
DO - 10.22052/ijmc.2014.7772
N2 - 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}.
UR - https://ijmc.kashanu.ac.ir/article_7772.html
L1 - https://ijmc.kashanu.ac.ir/article_7772_6c1386b641e42586265ac97c82fcede7.pdf
ER -