Twins Vertices in Hypergraphs

Raoul Medina (1) , Caroline Noyer , Olivier Raynaud (1)

1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes

Twin vertices in graphs correspond to vertices sharing the same neighborhood. We propose an extension to hypergraphs of the concept of twin vertices. For this we give two characterizations of twin vertices in hypergraphs, a first one in term of clone vertices (the concept of clone has been introduced in [16]) and a second one in term of committees (introduced in [6]). Finally we give an algorithm to aknowledge a set as committee and two algorithms to compute clone-twin vertices classes ans committee-twin vertices classes.

Mots clés: Hypergraphs; problem of generation; symmetries; twin vertices

Domaines: Recherche opérationnelle [math.OC]

Raoul Medina, Caroline Noyer, Olivier Raynaud. Twins Vertices in Hypergraphs. Electronic Notes in Discrete Mathematics, 2006, 27, pp.Pages 87-89. ⟨10.1016/j.endm.2006.08.069⟩. ⟨hal-00678051⟩