On Self-Complementary Cyclic Packing of Forests

A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementary graph of order 4p with a cyclic self-complementary permutation. We also discuss some generalization of the main result.

• Type: Journal
• Year: 2007
• Where: COMBINATORICS
• Authors: A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo
• Keywords: COMBINATORICS 2007, Cyclic Self-complementary Permutation, Isomorphic, Self-complementary Graph