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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have