A sharp upper bound for the number of stable sets in graphs with given number of cut edges.

Published in: Appl. Math. Lett. (2009)

Keyphrases

upper bound
small number
computational complexity
pairwise
directed graph
maximum number
disjoint sets
databases
information systems
lower bound
fixed number