Parcourir Department of Mathematics and Statistics par sujet "Complementing permutation"
Voici les éléments 1-3 de 3
-
Constructing Regular Self-complementary Uniform Hypergraphs
(Journal of Combinatorial Designs, 2011-02-17)In this paper, we examine the possible orders of t-subset-regular self-complementary k-uniform hypergraphs, which form examples of large sets of two isomorphic t-designs. We reformulate Khosrovshahi and Tayfeh-Rezaie's ... -
Generating self-complementary uniform hypergraphs
(Discrete Mathematics, 2010-02)In 2007, Szymanski and Wojda proved that for positive integers n; k with k less than n, a self-complementary k-uniform hypergraph of order n exists if and only if n/k is even. In this paper, we characterize the cycle type ... -
Vertex-transitive self-complementary uniform hypergraphs of prime order
(Discrete Mathematics, 2009-09)For an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a construction for vertex-transitive self-complementary k-uniform hypergraphs of order n for each integer n such that pn(p)≡1(mod2ℓ+1) ...