A simple proof is given for a result of Sali and Simonyi on selfcomplementary graphs. ß 2001 John Wiley & Sons, Inc. J Graph Theory 38: 111±112, 2001 Keywords: self-complementary graphs; transitive tournaments Motivated by Sperner capacities of digraphs, A. Sali and G. Simonyi [1] discovered an interesting property of self-complementary graphs. Here a proof of their result is given which is con...

Several de novo designed ionic peptides that are able to undergo conformational change under the influence of temperature and pH were studied. These peptides have two distinct surfaces with regular repeats of alternating hydrophilic and hydrophobic side chains. This permits extensive ionic and hydrophobic interactions resulting in the formation of stable beta-sheet assemblies. The other definin...

In this paper we examine the orders of vertex-transitive self-complementary uniform hypergraphs. In particular, we prove that if there exists a vertex-transitive selfcomplementary k-uniform hypergraph of order n, where k = 2 or k = 2 + 1 and n ≡ 1 (mod 2), then the highest power of any prime dividing n must be congruent to 1 modulo 2. We show that this necessary condition is also sufficient in ...

In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt holds, for any preassigned, algorithmic task, there exists a program that, in a sense, creates a copy of itself, and then performs that task on the self-copy. Herein, properties complementary to krt are considered. Of pa...

Self-complementary Cayley graphs are useful in the study of Ramsey numbers, but they are relatively very rare and hard to construct. In this paper, we construct several families of new self-complementary Cayley graphs of order p4 where p is a prime and congruent to 1 modulo 8.

Abstract. We prove a product formula for the remaining cases of the weighted enumeration of self–complementary plane partitions contained in a given box where adding one half of an orbit of cubes and removing the other half of the orbit changes the sign of the weight. We use nonintersecting lattice path families to express this enumeration as a Pfaffian which can be expressed in terms of the kn...

In this paper, the order, size and degree of the nodes of the isomorphic fuzzy graphs are discussed. Isomorphism between fuzzy graphs is proved to be an equivalence relation. Some properties of self complementary and self weak complementary fuzzy graphs are discussed. Keywords—complementary fuzzy graphs, co-weak isomorphism, equivalence relation, fuzzy relation, weak isomorphism.

In this note we prove that a self-complementary graph with p vertices is chordal if and only if its clique number is integral part of (p + 1)/2. (~) 1998 Elsevier Science B.V. All rights reserved

We introduce the notion of strong intuitionistic fuzzy graphs and investigate some of their properties. We discuss some propositions of self complementary and self weak complementary strong intuitionistic fuzzy graphs. We introduce the concept of intuitionistic fuzzy line graphs.

Throughout this paper all codes are assumed to be binary. A linear code C is formally self-dual (fsd) if C and its dual C have the same weight enumerator. While self-dual codes contain only even weight vectors, formally self-dual codes may contain odd weight codewords as well. Many authors consider only even formally self-dual codes because their weight enumerators are combinations of Gleason p...