A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the number of independent sets in cycle-separated tricyclic graphs
2011
Computers and Mathematics with Applications
A cycle-separated tricyclic graph (CSTC graph) is a connected simple graph with n vertices and n + 2 edges whose subgraph induced by its cycles consists of three disjoint cycles. In this paper we investigate the number of independent sets in CSTC graphs. We show that the tight upper bound for the number of independent sets in the n-vertex CSTC graphs is 48 × 2 n−9 + 9 (for n ≥ 9); we also characterize the extremal graph with respect to the aforementioned bound.
doi:10.1016/j.camwa.2011.01.021
fatcat:sgfdj7pmmbdr3gb3sodtg55zly