Title of article
Counting stable sets on Cartesian products of graphs Original Research Article
Author/Authors
Florence Forbes، نويسنده , , Bernard Ycart، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
12
From page
105
To page
116
Abstract
We study the generating functions for the number of stable sets of all cardinalities, in the case of graphs which are Cartesian products by paths, cycles, or trees. Explicit results are given for products by cliques. Algorithms based on matrix products are derived for grids, cylinders, toruses and hypercubes.
Journal title
Discrete Mathematics
Serial Year
1998
Journal title
Discrete Mathematics
Record number
951045
Link To Document