| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419764 | Discrete Applied Mathematics | 2009 | 5 Pages |
Abstract
A subset S⊆V(G)S⊆V(G) is independent if no two vertices of SS are adjacent in GG. In this paper we study the number of independent sets in graphs with two elementary cycles. In particular we determine the smallest number and the largest number of these sets among nn-vertex graphs with two elementary cycles. The extremal values of the number of independent sets are described using Fibonacci numbers and Lucas numbers.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mariusz Startek, Andrzej Włoch, Iwona Włoch,