Given a graph [Formula: see text], subset text] of is module if for each adjacent to all the elements or none them. For instance, and ([Formula: text]) are trivial modules text]. A prime its trivial. consider such that prime. text]-similar both not. The said be text]-birecognizable every graph, We study graphs not text]-birecognizable, where prime, by using following notion minimal graph. text]...