Connected graphs containing a given connected graph as a unique greatest common subgraph (Q1087564)

A greatest common subgraph of two nonisomorphic graphs \(G_ 1\) and \(G_ 2\) of equal size is any graph of maximum size without isolated vertices that is a subgraph of both \(G_ 1\) and \(G_ 2\), see i.e. \textit{G. Chartrand, F. Saba} and \textit{H. Zou} [Čas. Pěstování Mat. 110, 87-91 (1985; Zbl 0567.05044)]. Here the authors determine those connected graphs G for which there exist nonisomorphic connected graphs of equal size with G as a unique greatest common subgraph. Analogous results are proved for induced subgraphs and subdigraphs.