Szymański, Artur and Wojda, Adam Pawel - Self-complementing permutations of k-uniform hypergraphs

dmtcs:468 - Discrete Mathematics & Theoretical Computer Science, January 1, 2009, Vol. 11 no. 1
Self-complementing permutations of k-uniform hypergraphs

Authors: Szymański, Artur and Wojda, Adam Pawel

A k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it is isomorphic with its complement (H) over bar = ( V; ((V)(k)) - E). Every permutation sigma of the set V such that sigma(e) is an edge of (H) over bar if and only if e is an element of E is called self-complementing. 2-self-comlementary hypergraphs are exactly self complementary graphs introduced independently by Ringel ( 1963) and Sachs ( 1962). <br> For any positive integer n we denote by lambda(n) the unique integer such that n = 2(lambda(n)) c, where c is odd. <br> In the paper we prove that a permutation sigma of [1, n] with orbits O-1,..., O-m O m is a self-complementing permutation of a k-uniform hypergraph of order n if and only if there is an integer l >= 0 such that k = a2(l) + s, a is odd, 0 <= s <= 2(l) and the following two conditions hold: <br> (i)n = b2(l+1) + r,r is an element of {0,..., 2(l) - 1 + s}, and <br> (ii) Sigma(i:lambda(vertical bar Oi vertical bar)<= l) vertical bar O-i vertical bar <= r. <br> For k = 2 this result is the very well known characterization of self-complementing permutation of graphs given by Ringel and Sachs.

Source : oai:HAL:hal-00988180v1
Volume: Vol. 11 no. 1
Section: Graph and Algorithms
Published on: January 1, 2009
Submitted on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Browsing statistics

This page has been seen 49 times.
This article's PDF has been downloaded 25 times.