ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2019: 0.600
Rejection Rate (2018-2019): c. 84%
Discussiones Mathematicae Graph Theory 26(2) (2006)
A. Paweł Wojda
AGH University of Science and Technology
Faculty of Applied Mathematics
Department of Discrete Mathematics
Al. Mickiewicza 30, 30-059 Kraków, Poland
In the present paper, for every k, (1 ≤ k
≤ n), we give
a characterization of self-complementig permutations of k-uniform
self-complementary hypergraphs of the order n. This characterization
implies the well known results for self-complementing permutations of graphs,
given independently in the years 1962-1963 by Sachs and Ringel, and those
obtained for 3-uniform hypergraphs by Kocay, for 4-uniform hypergraphs
by Szymański, and for general (not uniform) hypergraphs by Zwonek.
Keywords: k-uniform hypergraph, self-complementary hypergraph.
2000 Mathematics Subject Classification: 05C65.
Received 18 July 2005
Revised 4 February 2006