Add to ORKGWe prove that a permutation theta is complementing permutation for a 4-uniform hypergraph if and only if one of the following cases is satisfied: (i) the length of every cycle of theta is a multiple of 8, (ii) theta has 1, 2 or 3 fixed points, and all other cycles have length a multiple of 8, (iii) theta has 1 cycle of length 2, and all other cycles have length a multiple of 8, (iv) theta has 1 fixed point, 1 cycle of length 2, and all other cycles have length a multiple of 8, (v) theta has 1 cycle of length 3, and all other cycles have length a multiple of 8. Moreover, we present algorithms for generating every possible 3 and 4-uniform self-complementary hypergraph
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if $\binom{n}...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
Abstract. We prove that a permutation θ is complementing permutation for a 4-uniform hypergraph if a...
We prove that a permutation \(\theta\) is complementing permutation for a \(4\)-uniform hypergraph i...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, cal...
AbstractIn 2007, Szymański and Wojda proved that for positive integers n,k with k≤n, a self-compleme...
Graphs and AlgorithmsA k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it...
It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is co...
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V ,...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ: V → V, ca...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if
In this thesis, we survey the current research into self-complementary hypergraphs, and present sev...
We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n ...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if $\binom{n}...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
Abstract. We prove that a permutation θ is complementing permutation for a 4-uniform hypergraph if a...
We prove that a permutation \(\theta\) is complementing permutation for a \(4\)-uniform hypergraph i...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, cal...
AbstractIn 2007, Szymański and Wojda proved that for positive integers n,k with k≤n, a self-compleme...
Graphs and AlgorithmsA k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it...
It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is co...
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V ,...
A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ: V → V, ca...
AbstractIn this paper we examine the orders of vertex-transitive self-complementary uniform hypergra...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if
In this thesis, we survey the current research into self-complementary hypergraphs, and present sev...
We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n ...
We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if $\binom{n}...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...