On self-complementary cyclic packing of forests (Q1010622)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On self-complementary cyclic packing of forests |
scientific article; zbMATH DE number 5540840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On self-complementary cyclic packing of forests |
scientific article; zbMATH DE number 5540840 |
Statements
On self-complementary cyclic packing of forests (English)
0 references
7 April 2009
0 references
Summary: 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.
0 references
self-complemetary graphs
0 references
forest
0 references
cyclic self-complementary permutation
0 references
0 references
0.8964287
0 references
0 references
0 references
0.87203914
0 references
0.8696666
0 references
0.86939013
0 references
0.8670887
0 references
0.8669646
0 references
