Counting stable sets on Cartesian products of graphs
type: Item
instance of: scholarly article
title: Counting stable sets on Cartesian products of graphs
zbMATH Open document ID: 0958.05065
DOI: 10.1016/S0012-365X(97)00185-4
author: F. Forbes
author: Bernard Ycart
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 1524864
zbMATH Keywords: generating functions
zbMATH Keywords: stable sets
zbMATH Keywords: Cartesian products
MaRDI profile type: Publication
cites work: Q3158579
cites work: On spin models, triply regular association schemes, and duality
cites work: Q4142699
cites work: Constraints on the number of maximal independent sets in graphs
cites work: Q3243274
cites work: Q4871778
cites work: Percolation and the hard-core lattice gas model
cites work: The Number of Maximal Independent Sets in a Tree
cites work: Q4002255
cites work: The philosophers' process: An ergodic reversible nearest particle system
cites work: The structure and maximum number of maximum independent sets in trees
full work available at URL: s0012-365x(97)00185-4
OpenAlex ID: W2085344283
description: scientific article; zbMATH DE number 1524864