## Abstract A method is described of constructing a class of selfโcomplementary graphs, that includes a selfโcomplementary graph, containing no __K__~5~, with 41 vertices and a selfโcomplementary graph, containing no __K__~7~, with 113 vertices. The latter construction gives the improved Ramsey num
The number of self-complementary achiral necklaces
โ Scribed by E. M. Palmer; A. J. Schwenk
- Publisher
- John Wiley and Sons
- Year
- 1977
- Tongue
- English
- Weight
- 304 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
Necklaces with beads of two colors which are left unchanged both by a reflection as well as by the interchange of the two colors are characterized in terms of their axes of symmetry. This characterization is then used to enumerate them. For n = 2^r^m with r โฅ 1 and m odd, the number of selfโcomplementary achiral necklaces is magnified image for large even n, this sum is asymptotic to 2^{n/4}โ1^.
๐ SIMILAR VOLUMES
We prove that the edges of a self-complementary graph and its complement can be oriented in such a way that they remain isomorphic as digraphs and their union is a transitive tournament. This result is used to explore the relation between the Shannon and Sperner capacity of certain graphs. In partic
This paper describes a compact, self-complementary square-spiral antenna on a GaAs substrate with a broadside high-directivity (ฯณ29 dB) frequency-independent pattern when coupled through a silicon hyperhemisphere. The driving-point resistance undulates between ฯณ100 and 300โ from 200 GHz to 1 THz-muc