Counting stable sets on Cartesian products of graphs

Discrete Mathematics

Volumn 186, Issue 1-3, 1998, Pages 105-116

  Forbes, Florence ^a   Ycart, Bernard ^a  

^a LMC   (France)

Author keywords

Cartesian products; Generating functions; Stable sets

Indexed keywords

EID: 0041783324     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00185-4     Document Type: Article

References (12)

1. G. Chartrand, L. Lesniak, Graphs and Digraphs, 2nd ed., Mathematics Series, Wadsworth & Brooks/Cole, Belmont, CA, 1986.
2. F. Jaeger, On spin models, triply regular association schemes and duality, J. Alg. Combin. 4 (1995) 103-144.
3. I. Kaplanski, Solution of the 'Problème des Ménages', Bull. Amer. Math. Soc. 49 (1943) 355-374.
4. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
5. J. Liu, Constraints on the number of maximal independent sets in graphs, J. Graph Theory 18 (2) (1994) 195-204.
6. J. Riordan, An Introduction to Combinatorial Analysis, Wiley, London, 1958.
7. A. Schrijver, Polyhedral combinatorics, in: R. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics, Elsevier, Amsterdam, 1995, pp. 1649-1704.
8. J. van den Berg, J.E. Steif, Percolation and the hard-core lattice gas model, Stochastic Processes Appl. 49 (1994) 179-197.
9. H.S. Wilf, The number of maximal independent sets in a tree, J. Algebra Discrete Methods 7 (1986) 125-130.
10. R.M. Wilson, J.H. Van Lint, A Course in Combinatorics, Cambridge University Press, Cambridge, 1992.
11. B. Ycart, The Philosophers' Process: an ergodic reversible nearest particle system, Ann. Appl. Probab. 3 (2) (1993) 356-363.
12. J. Zito, The structure and maximum number of maximum independent sets in trees, J. Graph Theory 15 (2) (1991) 207-221.