Displaying 301 – 320 of 410

Showing per page

Self-complementary hypergraphs

A. Paweł Wojda (2006)

Discussiones Mathematicae Graph Theory

A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, called self-complementing, such that for every k-subset e of V, e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H ' = ( V ; V k - E ) . 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,...

Currently displaying 301 – 320 of 410