These two poker hands are graph isomorphic via a trivial suit-shifting function f:
G = Ah Kc Qd Js Th
H = Ac Kd Qs Jh Tc
V(H) = f(V(G)) where f shifts the suits
Question: how do I represent these hands as graphs such that I can test for isomophism algorithmically? I assume the ranks and suits will have to form a bipartite graph, but I'm not sure how the different cards within the hand should be modeled as nodes.
===EDIT - clarifying the isomorphism===
I would like for the following two hands not to be isomorphic.
G = Ah Kc Qd Js Th
H = Ah Kc Qd Js Tc
Is there any way to restrict the model such that the first case above would be isomorphic but this second case wouldn't?
Put another way, is there any way to constrain the isomorphism tests so that they only allow for suit shifting and not rank shifting functions?