@article {
author = {Marandi, A. and Nejah, A. and Behmaram, A.},
title = {Perfect Matchings in Edge-Transitive Graphs},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {5},
number = {Supplement 1},
pages = {27-33},
year = {2014},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2014.7772},
abstract = {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}.},
keywords = {perfect matching,Edge-transitive graph},
url = {https://ijmc.kashanu.ac.ir/article_7772.html},
eprint = {https://ijmc.kashanu.ac.ir/article_7772_6c1386b641e42586265ac97c82fcede7.pdf}
}