|
Título: Enumeration of connected hypergraphs Marco de Trabajo: DOCTORADO Área de desarrollo: Análisis de Algoritmos Autor: Andriamampianina Tsiriniaina Contacto: tsr@lipn.univ-paris13.fr Día: VIERNES Hora: 11:00:00 Palabras Claves: Enumeration,exponential generating function, hypergraph Resumen: We develop a generating function approach to count families of labeled connected b-uniform hypergraphs. Results on connected graphs enumeration is generalized here to connected uniform hypergraphs: exponential generating function of labeled connected b-uniform hypergraphs of a given excess are expressed in terms of the exponential generating function of rooted hypertrees. For this purpose we show how to compute step by step the generating functions from differential equations and provide combinatorial arguments to explain the form of the coumputed results. |
| Ultima modificacion 5 de Octubre 2004 16:30 |