Title of article :
Counting perfect matchings in n-extendable graphs
Author/Authors :
Tomislav Do?li?، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Abstract :
The structural theory of matchings is used to establish lower bounds on the number of perfect matchings in n-extendable graphs. It is shown that any such graph on p vertices and q edges contains at least image different perfect matchings, where image is the maximum degree of a vertex in G.
Keywords :
n-extendable graph , Perfect matching , Enumeration
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
