Hot answers tagged


What you are looking for is called isomorphism for coloured graphs. Both vertices and edges may be "coloured" with colours chosen from a discrete set, and only those isomorphisms are admitted which map a vertex (or edge) into another one that has the same colour. Using edge/vertex weights for this is not really appropriate. These properties are meant to ...

Only top voted, non community-wiki answers of a minimum length are eligible