Vertex-transitive self-complementary uniform hypergraphs of prime order

WinnSpace/Manakin Repository

Vertex-transitive self-complementary uniform hypergraphs of prime order

Show simple item record Gosselin, Shonda 2010-12-17T20:39:35Z 2010-12-17T20:39:35Z 2009-09
dc.description.abstract For an integer n and a prime p, let n.p/ D maxfi V pi divides ng. 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 .mod 2`C1/ for every prime p, where ` D max fk.2/; .k􀀀1/.2/g, and consequently we prove that the necessary conditions on the order of vertex-transitive self-complementary uniform hypergraphs of rank k D 2` or k D 2` C 1 due to Poto┬Čick and ajna are sufficient. In addition, we use Burnside's characterization of transitive groups of prime degree to characterize the structure of vertex-transitive selfcomplementary k-hypergraphs which have prime order p in the case where k D 2` or k D 2` C 1 and p 1 .mod 2`C1/, and we present an algorithm to generate all of these structures. We obtain a bound on the number of distinct vertex-transitive selfcomplementary graphs of prime order p 1 .mod 4/, up to isomorphism. en_US
dc.description.sponsorship University of Winnipeg en_US
dc.language.iso en en_US
dc.publisher Discrete Mathematics en_US
dc.subject Self-complementary graphs en_US
dc.subject Uniform hypergraphs en_US
dc.subject Transitive hypergraphs en_US
dc.subject Complementing permutation en_US
dc.title Vertex-transitive self-complementary uniform hypergraphs of prime order en_US
dc.type Article en_US

Files in this item

Files Size Format View Description
VTSC Hyp FINAL.pdf 852.2Kb PDF View/Open [Main Article] This is an author-produced, peer-reviewed article that has been accepted for publication in Discrete Mathematics, but has not been copyedited.

This item appears in the following Collection(s)

Show simple item record

Search WinnSpace

Advanced Search


My Account