The class of cellular automata created by the rules with the same graph of connections

One of possible class of two-dimensional cellular automata created by rules with one graph of connections is described in the paper. Basing on the computer simulation, the behaviour of cellular automata generated by rules with rotated and mirror reflected graph is tested. Close similarity between these cellular automata is observed. They process the initial signal (picture) in qualitatively the same way. Thanks to obtained results we can expect that searching of the cellular automata space in order to extract automata with interesting behaviour can be easier. It can be reduced to testing only one cellular automaton representing such class connected with one graph of connections.