http://dspace.nbuv.gov.ua:80/handle/123456789/188466 Mon, 20 Apr 2026 06:21:52 GMT 2026-04-20T06:21:52Z http://dspace.nbuv.gov.ua:80/bitstream/id/564077/ http://dspace.nbuv.gov.ua:80/handle/123456789/188466 http://dspace.nbuv.gov.ua:80/handle/123456789/188483 Some combinatorial characteristics of closure operations Nguyen Hoang Son; Vu Duc Thi The aim of this paper investigates some combinatorial characteristics of minimal key and antikey of closure operations. We also give effective algorithms finding minimal keys and antikeys of closure operations. We estimate these algorithms. Some remarks on the closeness of closure operations class under the union and direct product operations are also studied in this paper. Tue, 01 Jan 2019 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/188483 2019-01-01T00:00:00Z http://dspace.nbuv.gov.ua:80/handle/123456789/188482 Representations of strongly algebraically closed algebras Molkhasi, A.; Shum, K.P. We introduce the notion of q′-compactness for MV-algebras. One of the main results of the paper is a characterization of a class of orthomodular lattices that are horizontal sums of strongly algebraically closed algebras. Tue, 01 Jan 2019 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/188482 2019-01-01T00:00:00Z http://dspace.nbuv.gov.ua:80/handle/123456789/188481 Lie algebras of derivations with large abelian ideals Klymenko, I.S.; Lysenko, S.V.; Petravchuk, A. We study subalgebras L of rank m over R of the Lie algebra Wn(K) with an abelian ideal I ⊂ L of the same rank m over R. Tue, 01 Jan 2019 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/188481 2019-01-01T00:00:00Z http://dspace.nbuv.gov.ua:80/handle/123456789/188480 On the existence of degree-magic labellings of the n-fold self-union of complete bipartite graphs Inpoonjai, P.; Jiarasuksakun, T. Magic rectangles are a classical generalization of the well-known magic squares, and they are related to graphs. A graph G is called degree-magic if there exists a labelling of the edges by integers 1, 2, . . . , |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal to (1 + |E(G)|) deg(v)/2. Degree-magic graphs extend supermagic regular graphs. In this paper, we present a general proof of the necessary and sufficient conditions for the existence of degree-magic labellings of the n-fold self-union of complete bipartite graphs. We apply this existence to construct supermagic regular graphs and to identify the sufficient condition for even n-tuple magic rectangles to exist. Tue, 01 Jan 2019 00:00:00 GMT http://dspace.nbuv.gov.ua:80/handle/123456789/188480 2019-01-01T00:00:00Z