|
Fixed-point-free embeddings of graphs in their complementsDOI: 10.1155/s0161171278000356 Keywords: labeled graph , complement , and embedding. Abstract: The following is proved: If G is a labeled (p,p ¢ ’2) graph where p ¢ ‰ ¥2, then there exists an isomorphic embedding of G in its complement G ˉ such that has no fixed vertices. The extension to (p,p ¢ ’1) graphs is also considered.
|