Published in Discuss. Math. Graph Theory1 March 2013

Mathematics

Abstract Let F be a forest of order n. It is well known that if F 6= Sn, a star of order n, then there exists an embedding of F into its complement F. In this note we consider a problem concerning the uniqueness of such an embedding.

Let F be a forest of order n . It is well known that if F 6 = S n , a star of order n , then there exists an embedding of F into its complement F . In this note we consider a problem concerning the… Expand

Let F be a forest of order n . It is well known that if F 6 = S n , a star of order n , then there exists an embedding of F into its complement F . In this note we consider a problem concerning the… Expand

AbstractA graphG is embeddable in its complement
$$\bar G$$
ifG is isomorphic with a subgraph of
$$\bar G$$
. A complete characterization is given of those (p,p−1) graphs which are embeddable in… Expand