• Aucun résultat trouvé

Counting non-isomorphic maximal independent sets of the n-cycle graph

N/A
N/A
Protected

Academic year: 2021

Partager "Counting non-isomorphic maximal independent sets of the n-cycle graph"

Copied!
1
0
0

Texte intégral

(1)

Counting non-isomorphic maximal independent sets of the

n-cycle graph

Raymond Bisdorff

Jean-Luc Marichal

Applied Mathematics Unit, University of Luxembourg 162A, avenue de la Fa¨ıencerie, L-1511 Luxembourg, Luxembourg

{jean-luc.marichal,raymond.bisdorff}[at]uni.lu

Abstract

It is known that the number of maximal indepen-dent sets of the n-cycle graph Cn is given by the

nth term of the Perrin sequence. The action of the automorphism group of Cn on the family of

these maximal independent sets partitions this fam-ily into disjoint orbits, which represent the non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets. We provide exact formulas for the total number of orbits and the number of orbits having a given number of iso-morphic representatives. We also provide exact for-mulas for the total number of unlabelled (i.e., de-fined up to a rotation) maximal independent sets and the number of unlabelled maximal independent sets having a given number of isomorphic represen-tatives. It turns out that these formulas involve both Perrin and Padovan sequences.

Keywords: Maximal independent set, cycle graph, combinatorial enumeration, dihedral group, group action, cyclic and palindromic composition of integers, Perrin and Padovan sequences.

References

[1] G. J. Chang and M.-J. Jou. The number of max-imal independent sets in connected triangle-free graphs. Discrete Math., 197/198:169–178, 1999. 16th British Combinatorial Conference (Lon-don, 1997).

[2] R. Euler. The Fibonacci number of a grid graph and a new class of integer sequences. J.

Inte-ger Seq., 8(2):Article 05.2.6, 16 pp. (electronic), 2005.

[3] Z. F¨uredi. The number of maximal indepen-dent sets in connected graphs. J. Graph Theory, 11(4):463–470, 1987.

[4] C. Godsil and G. Royle. Algebraic graph theory, volume 207 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2001.

[5] S. Kitaev. Independent sets on path-schemes. J. Integer Seq., 9(2):Article 06.2.2, 8 pp. (elec-tronic), 2006.

[6] N. J. A. Sloane (editor). The on-line encyclopedia of integer sequences.

(http://www.research.att.com/~njas/sequences/).

Références

Documents relatifs

Let (ε k ) ∞ k=1 be a se- quence of independent Bernoulli random variables, taking values ±1 with probability 1/2.. It follows that some convex functions of the convolution

EXPECTATION AND VARIANCE OF THE VOLUME COVERED BY A LARGE NUMBER OF INDEPENDENT RANDOM

We also provide exact formulas for the total num- ber of unlabeled (i.e., defined up to a rotation) maximal independent sets and the number of unlabeled maximal independent sets

The orbit of isomorph maximal independent sets or cliques in a digraph G following the automorphism group Aut(G) is called an unlabelled MIS, respec- tively an unlabelled clique of

algorithms for trees and bounded degree graphs with time complexity O(log * (n)). From Coloring

Based on this cardinality operation we not only prove the approximation bound but also facts about the cardinalities of vectors and points in a calculational, algebraic manner only..

To discard the logarithmic error term in [AV09, Theorem 1.2], we reformulate the main theorems of Amoroso and Viada so that they suit our particular case of torsion subvarieties.. To

Let us also mention the article of Alter, Caselles and Chambolle [2], where the evolution of convex sets in the plane by the flow of the total variation is explicitly given (with