Automorphisms of Steiner 2-designs S(2, 4, 37) are studied and used to find many new examples. Some of the constructed designs have S(2, 3, 9) subdesigns, closing the last gap in t...
Abstract. There are several well-known and important hamiltonian results for claw-free graphs but only a few are concerned with quasi-claw-free graphs. In this note, we provide a n...
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on...
Jennifer D. Key, Jamshid Moori, Bernardo Gabriel R...