Recognition of prime graphs from a prime subgraph.

Abstract: Given a graph , a subset of is a module of if for each , is adjacent to all the elements of or to none of them. A graph is prime if and the only modules of are , , and singleton vertex sets. Given a prime induced subgraph , we introduce a digraph that yields a necessary and sufficient condition for to be prime. [Copyright &y& Elsevier]