[Nauty-list] Labeled graphs

[Edel Mary Sherratt [eds]]

Dear Amina,
A few ago I used Nauty to eliminate isomorphisms in a program that generated all combinations of atoms in molecules subject to valency rules.  Essentially, I made the edges (bonds) into nodes and used as edges the nodes (atoms).    Let me know if you'd like a copy of the code; it is pretty old - I expect it will need updating to compile  - and  is mainly written in Haskell with a C interface to Nauty.  Graphs with three nodes and three edges are a special case.
Best regards,
Edel Sherratt

From: nauty-list-bounces at cs.anu.edu.au [mailto:nauty-list-bounces at cs.anu.edu.au] On Behalf Of Amina Kemmar
Sent: 08 September 2013 10:43
To: nauty-list at cs.anu.edu.au
Subject: [Nauty-list] Labeled graphs

Dear all users,

I want to test isomorphism of labeled graphs such as:

v 0 1
v 1 4
v 2 3
e 0 1 2
e 0 2 3

where:

v 0 1 means that the vertex of id=0 has label=1
e 0 1 2 means that the edge between the vertices 0 and 1 has label=2

  1.  To attribute colors to vertices, we use the vectors lab and ptn, this allows to divide vertices into classes but the real value of the color (label) is not considered?
  2.  I don't understand how to specify edge labels of the graph?

Thank you.
---
Amina
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.anu.edu.au/mailman/private/nauty/attachments/20130909/c21ba7ef/attachment.html