A representation for the modules of a graph and applications

Sulamita KleinJaime L. Szwarcfiter

We describe a simple representation for the modules of a graph G . We show that the modules of G are in one-to-one correspondence with the ideals of certain posets. These posets are characterized and shown to be layered posets, that is, transitive closures of bipartite tournaments. Additionaly, we describe applications of the representation. Employing the above correspondence, we present methods for solving the following problems: (i) generate all modules of G , (ii) count the number of modules of G , (iii) find a maximal module satisfying some hereditary property of G and (iv) find a connected non-trivial module of G .

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: