Results 261 to 270 of about 5,373,085 (299)

Self-complementary antennas

IEEE Antennas and Propagation Magazine, 1992
exaly   +2 more sources

Proper self-complementary codes

2010 International Symposium On Information Theory & Its Applications, 2010
It is an open question if there exists proper binary linear codes for error detection for all lengths and dimensions. It is known that such codes exist for any given dimension when the length is above some explicit bound. The main result in this paper is new explicit bound that is much lower than the previously known bound. The construction is based on
Torleiv Kløve, Somaye Yari
openaire   +1 more source

Self-Complementary Phosphonate Cavitands

The Journal of Organic Chemistry, 2009
iii-Phosphorylated cavitands incorporating an N-methylpyridinium guest moiety as the fourth bridging unit form supramolecular associations by inclusion of the charged CH(3)N(+)-pyridinium head into a neighboring host cavity. The dimeric association is favored in solution and was characterized by NMR, mass spectrometry, DOSY experiments, and single ...
DUBESSY B., HARTHONG S., ARONICA C., BOUCHU D., BUSI, Marco, DALCANALE, Enrico, DUTASTA J. P.   +6 more
openaire   +3 more sources

The symmetry of self-complementary surfaces

Journal of Molecular Biology, 1979
Abstract The concept of molecular complementarity is defined, and a theorem given which describes the symmetry required of self-complementary surfaces. We show in detail that the surfaces of chymotrypsin and concanavalin A have this symmetry, while that of the α chain of human deoxyhemoglobin does not.
R S, Morgan, S L, Miller, J M, McAdon
openaire   +2 more sources

On regular self‐complementary graphs

Journal of Graph Theory, 1987
AbstractA 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.
openaire   +2 more sources

Self‐complementary symmetric graphs

Journal of Graph Theory, 1992
AbstractThe class of self‐complementary symmetric graphs is characterized using the classification of finite simple group.
openaire   +1 more source

Enumeration of Bipartite Self-Complementary Graphs

Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Makoto Ueno, Shinsei Tazawa
openaire   +1 more source

The number of self‐complementary achiral necklaces

Journal of Graph Theory, 1977
AbstractNecklaces 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 = 2rm with r ≥ 1 and m odd, the number of self‐complementary achiral necklaces is magnified image for ...
Edgar M. Palmer, Allen J. Schwenk
openaire   +1 more source