No label defined (Q4374728)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1109416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1109416 |
Statements
25 January 1998
0 references
decomposition of graphs
0 references
self-complementary graphs
0 references
stable complementary permutation
0 references
0.9156826
0 references
0.8881983
0 references
0 references
0.84544647
0 references
0.83767146
0 references
The paper deals with the problem of the decomposition of a complete graph into isomorphic factors. This problem is introduced as a generalization of a self-complementary graph, and called a {\(t\)-sc graph} (\(t\) is the number of factors). A \(t\)-sc graph has a {stable self-complementing permutation} \(\pi \) if all its factors are obtained by iterating \(\pi \) on the first one, and also \(\pi ^t=\) id. Some sufficient conditions for a graph to have a stable complementing permutation are proved and several counterexamples to possible improvements are constructed.
0 references
