Closed formulas for the numbers of small
โ
Charles Delorme; Odile Favaron; Dieter Rautenbach
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 192 KB
We derive closed formulas for the numbers of independent sets of size at most 4 and matchings of size at most 3 in graphs without small cycles that depend only on the degree sequence and the products of the degrees of adjacent vertices. As a related problem we describe an algorithm that determines