Now showing items 1-3 of 3

    • Cyclically t-complementary uniform hypergraphs 

      Gosselin, Shonda (European Journal of Combinatorics, 2010-05)
      A cyclically t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation 2 Sym.V/ such that the sets E; E ; E 2; : : : ; E t􀀀1 partition the set of all ...
    • Regular Two-Graphs and Equiangular Lines 

      Gosselin, Shonda (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 

      Gosselin, Shonda (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 ...