Thanks Naraj ! Do you know research work on the graphs that are not homomorphic ? e.g. Where the mutation has a known (or assumed) probability distribution !
>> Chi, mutating graphs are the graphs that changes with time. e.g. the edges might be modified with each step in traversal. You can think of many interesting problems that you can solve on mutating graphs link finding algorithms for optimized path.