A new concept of primeness in graphs

Abstract

Abstract A graph is quasiprime with respect to a boolean product of graphs if whenever it is a subgraph of the product of two graphs, it must necessarily be isomorphic to a subgraph of one of its factors. This paper provides a characterization of graphs quasi‐prime with respect to cartesian product, as well as graphs quasiprime with respect to other products.