Title of article
On the number of connected sets with the neighborhood of a given size in a graph Original Research Article
Author/Authors
A.A. Sapozhenko، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
15
From page
233
To page
247
Abstract
We obtain upper bounds of the form 2g(1−ϵ) for the number of d-connected sets in a graph with the neighborhood of a given size. These bounds allow us to obtain asymptotic results for some classes of enumeration problems.
Keywords
Subgraph , Neighborhood , asymptotics , Enumeration
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885304
Link To Document