A regular self-complementary graph is presented which has no complementing permutation consisting solely of cycles of length four. This answers one of Kotzig's questions.
Constructing regular self-complementary uniform hypergraphs
β Scribed by Shonda Gosselin
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 181 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
In this article, we examine the possible orders of t-subset-regular selfcomplementary k-uniform hypergraphs, which form examples of large sets of two isomorphic t-designs. We reformulate Khosrovshahi and Tayfeh-Rezaie's necessary conditions on the order of these structures in terms of the binary representation of the rank k, and these conditions simplify to a more transparent relation between the order n and rank k in the case where k is a sum of consecutive powers of 2. Moreover, we present new constructions for 1-subset-regular self-complementary uniform hypergraphs, and prove that these necessary conditions are sufficient for all k, in the case where t = 1.
π SIMILAR VOLUMES
## Abstract It is shown that certain conditions assumed on a regular selfβcomplementary graph are not sufficient for the graph to be strongly regular, answering in the negative a question posed by Kotzig in [1].
The main topic of the paper is the question of the existence of self-complementary Cayley graphs Cay(G, S) with the property S Ο = G # \ S for all Ο β Aut(G). We answer this question in the positive by constructing an infinite family of self-complementary circulants with this property. Moreover, we