✍ Scribed by M.R. Sridharan
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A topology on a set X is self complementary if there is a homeomorphic copy on the same set that is a complement in the lattice of topologies on X. The problem of characterizing finite self complementary topologies leads us to redefine the problem in terms of preorders (i.e. reflexive, transitive re
## Abstract The class of self‐complementary symmetric graphs is characterized using the classification of finite simple group.
## Abstract A directed triple system, DTS(__v__) = (X,ℬ︁), is called self‐converse if it and its converse (X,ℬ︁^−1^) are isomorphic, where ℬ︁ = {(z,y,x);(x,y,z) ∈ ℬ︁}. In this article, the existence spectrum of self‐converse DTS(__v__) is given, which is __v__ ≡ 0 or 1 (mod 3) and __v__ ≠ 6. © 1994
## Abstract A simple proof is given for a result of Sali and Simonyi on self‐complementary graphs. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 111–112, 2001
We prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side 2n equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube, without explicitly evaluating either of these numbers. This appea