Counting stable sets on Cartesian products of graphs

DOI10.1016/S0012-365X(97)00185-4zbMath0958.05065OpenAlexW2085344283MaRDI QIDQ1584266

Florence Forbes, Bernard Ycart

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00185-4

zbMATH Keywords

generating functionsCartesian productsstable sets

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The philosophers' process: An ergodic reversible nearest particle system
• Percolation and the hard-core lattice gas model
• On spin models, triply regular association schemes, and duality
• The Number of Maximal Independent Sets in a Tree
• The structure and maximum number of maximum independent sets in trees
• Constraints on the number of maximal independent sets in graphs

This page was built for publication: Counting stable sets on Cartesian products of graphs