Browsing Shonda Gosselin by Title
Now showing items 3-6 of 6
-
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 ... -
Regular Two-Graphs and Equiangular Lines
(University of WinnipegUniversity of Waterloo, 2004)Regular two-graphs are antipodal distance-regular double coverings of the complete graph, and they have many interesting combinatorial properties. We derive a construction for regular two-graphs containing cliques of ... -
Self-Complementary Hypergraphs
(University of OttawaUniversity of Ottawa and Carleton University (joint program), 2009)In this thesis, we survey the current research into self-complementary hypergraphs, and present several new results. We characterize the cycle type of the permutations on n elements with order equal to a power of 2 which ... -
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) ...
