Abstract
A general formula is derived for the matching polynomial of an arbitrary graph G. This yields a method for counting matchings in graphs. From the general formula, explicit formulae are deduced for the number of k-matchings in several well-known families of graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
