The number of independent sets in unicyclic graphs

Anders Sune Pedersen, Preben Dahl Vestergaard

Publikation: Bog/antologi/afhandling/rapportRapportForskning

71 Citationer (Scopus)
1668 Downloads (Pure)

Abstract

  In this paper, we determine upper and lower bounds for the number of independent sets in a unicyclic graph in terms of its order. This gives an upper bound for the number of independent sets in a connected graph which contains at least one cycle. We also determine the upper bound for the number of independent sets in a unicyclic graph in terms of order and girth. In each case we characterize the extremal graphs.
OriginalsprogEngelsk
UdgivelsesstedDept. of Mathematical Sciences
ForlagAalborg Universitetsforlag
Antal sider12
StatusUdgivet - 2005
NavnResearch Report Series
NummerR-2005-09
ISSN1399-2503

Fingeraftryk

Dyk ned i forskningsemnerne om 'The number of independent sets in unicyclic graphs'. Sammen danner de et unikt fingeraftryk.

Citationsformater