There is an well known algorithm given by E.M Luks for bounded graph isomorphism. There are three important steps of the algorithm two of them are given below:


1. If the group action on vertex set of input graph is transitive (single orbit) then solve the isomorphism problem in each coset:


$$ISO(G,X,Y) = ISO(K\_i\sigma\_1,X,Y) \cup ISO(K\_i\sigma\_2,X,Y)\cdots ISO(K\_i\sigma\_k,X,Y)$$


where $k$ is number of cosets. The $K\_i$ is a kernel of group action $\pi : G \times B \mapsto B$.


2. If the group action on vertex set of input graph is not transitive and let $B\_1,B\_2,\cdots B\_l$ are the orbits (see group action $\pi$). Then we solve problem in each orbit :
$$ISO\_B(K\_i\sigma\_1,X,Y)=ISO\_{B\_{1}} (ISO\_{B\_{2}}\cdots ISO\_{B\_l}(K\_i\sigma\_1))$$



> 
> Questions :
> 
> 
> 1. From step we will be getting the solutions , but how to patch these all solutions to get a solution to original problem.
> 2. In step set $B = \{B\_1,B\_2, \cdots, B\_l\}$ is a collection of orbits , If $B$ is a minimal system of imprimitivity then (step 2) still works or not.
> 
> 
> 



Some doubts on the algorithm of graph isomorphism of bounded degree graph
1. We know that each $ISO$ is either a coset or an empty set. Suppose that non-empty answers to children $ISO$'s are cosets $g\_i H\_i$. Take $g\_1$ as a representative for the resulting coset, then the subgroup $H$ corresponding to the resulting coset is induced by $g\_1^{-1}g\_i h\_i$, where $h\_i$ ranges over generators of $H\_i$.
2. No, why would it work? The transitive case is treated with enumerating elements of the primitive action on the minimal system of imprimitivity (and corresponding cosets of the action kernel) rather than with direct restriction to the blocks, so the question seems totally irrelevant to the understanding of the algorithm.


