Séminaire Lotharingien de Combinatoire, B27f (1991), 22
pp.
[Formerly: Publ. I.R.M.A. Strasbourg, 1992, 473/S-27, p.
25-46.]
Ivan Constantineau
Sur le nombre de graphes connexes fixés
par l'action d'une permutation donnée
Abstract.
For any integer n ≥ 0, let [n] = {l,2,...,n}
if n > 0 and [0] = ∅. Let β be any
permutation of [n]. In this paper, we compute explicitely (obtaining a
closed formula) the number of connected (simple) graphs on [nj fixed
by β.
The following version is available: