21810 articles – 15605 Notices  [english version]

hal-00411981, version 1

Graphs as rotations

Dainis Zeps () 1

(01/01/1996)

Résumé : Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces. Further, we define multiplication of these objects, that coincides with the multiplication of permutations. We consider closed under multiplication classes of combinatorial maps that consist of closed classes of combinatorial maps with fixed edges where each such class is defined by a knot. One class among them is special, containing selfconjugate maps.

  • 1 :  Institute of Mathematics and Computer Science (IMCS)
  • University of Latvia
  • Domaine : Mathématiques/Combinatoire
  • Mots-clés : combinatorial maps – permutations – graphs on surface
  • Commentaire : preprint in KAM Series – 96-327 – Prague – 1996 – 9pp.
 
  • hal-00411981, version 1
  • oai:hal.archives-ouvertes.fr:hal-00411981
  • Contributeur : 
  • Soumis le : Lundi 31 Août 2009, 12:36:05
  • Dernière modification le : Mardi 1 Septembre 2009, 08:33:10