Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$.  Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...

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]...