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 (ܩ ) = (2ݍ / ) (ܩ \{ݑ ,ݒ }), where (ܩ ) denotes the number of perfect matchings in G, ܩ \{ݑ ,ݒ } is the graph constructed from ܩ by deleting edges with an end vertex in {u,v} and uv E(G).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
