Temat: complementary - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Self-complementary hypergraphs
Autorzy:: Wojda, A.
Powiązania:: https://bibliotekanauki.pl/articles/743928.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: k-uniform hypergraph
self-complementary hypergraph
Opis:: 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; \binom{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, 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.
Źródło:: Discussiones Mathematicae Graph Theory; 2006, 26, 2; 217-224
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Almost Self-Complementary 3-Uniform Hypergraphs
Autorzy:: Kamble, Lata N.
Deshpande, Charusheela M.
Bam, Bhagyashree Y.
Powiązania:: https://bibliotekanauki.pl/articles/31342164.pdf
Data publikacji:: 2017-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: uniform hypergraph
self-complementary hypergraph
almost complete 3-uniform hypergraph
almost self-complementary hypergraph
quasi regular hypergraph
Opis:: It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and only if n is congruent to 3 modulo 4. The structure of corresponding complementing permutation is also analyzed. Further, we prove that there does not exist a regular almost self-complementary 3-uniform hypergraph on n vertices where n is congruent to 3 modulo 4, and it is proved that there exist a quasi regular almost self-complementary 3-uniform hypergraph on n vertices where n is congruent to 3 modulo 4.
Źródło:: Discussiones Mathematicae Graph Theory; 2017, 37, 1; 131-140
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: A note on self-complementary 4-uniform hypergraphs
Autorzy:: Szymański, A.
Powiązania:: https://bibliotekanauki.pl/articles/255191.pdf
Data publikacji:: 2005
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: complementing permutation
self-complementary hypergraph
k-uniform hypergraph
Opis:: We 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.
Źródło:: Opuscula Mathematica; 2005, 25, 2; 319-323
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: A note on k-uniform self-complementary hypergraphs of given order
Autorzy:: Szymański, Artur
Wojda, A.
Powiązania:: https://bibliotekanauki.pl/articles/743151.pdf
Data publikacji:: 2009
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: self-complementing permutation
self-complementary hypergraph
k-uniform hypergraph
binomial coefficients
Opis:: We prove that a k-uniform self-complementary hypergraph of order n exists, if and only if $\binom{n}{k}$ is even.
Źródło:: Discussiones Mathematicae Graph Theory; 2009, 29, 1; 199-202
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

Tytuł:: The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
Autorzy:: Kamble, Lata N.
Deshpande, Charusheela M.
Bam, Bhagyashree Y.
Powiązania:: https://bibliotekanauki.pl/articles/31340929.pdf
Data publikacji:: 2016-05-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: self-complementary hypergraph
uniform hypergraph
regular hypergraph
quasi regular hypergraph
bi-regular hypergraph
Opis:: A k-uniform hypergraph H = (V; E) is called self-complementary if there is a permutation σ : V → V, called a complementing permutation, 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 this paper we define a bi-regular hypergraph and prove that there exists a bi-regular self-complementary 3-uniform hypergraph on n vertices if and only if n is congruent to 0 or 2 modulo 4. We also prove that there exists a quasi regular self-complementary 3-uniform hypergraph on n vertices if and only if n is congruent to 0 modulo 4.
Źródło:: Discussiones Mathematicae Graph Theory; 2016, 36, 2; 419-426
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja