<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Algebra and Discrete Mathematics, 2019, Vol. 28, № 2</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/188467" rel="alternate"/>
<subtitle/>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/188467</id>
<updated>2026-04-20T06:23:21Z</updated>
<dc:date>2026-04-20T06:23:21Z</dc:date>
<entry>
<title>Free ultra-groups, generators and relations</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/188496" rel="alternate"/>
<author>
<name>Tolue, B.</name>
</author>
<author>
<name>Zolfaghari, P.</name>
</author>
<author>
<name>Moghaddasi, Gh.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/188496</id>
<updated>2023-03-02T23:27:14Z</updated>
<published>2019-01-01T00:00:00Z</published>
<summary type="text">Free ultra-groups, generators and relations
Tolue, B.; Zolfaghari, P.; Moghaddasi, Gh.
In this paper, we intend to define an ultra-group by its presentation. The attitude of the presentation for a group was the key for us to investigate in this area. Instead of writing whole elements of an ultra-group, we denote it by its generators and the relations among those generators. A general computational approach for finitely presented ultra-groups by quotient ultra-groups and subultra-groups is described and some examples are presented. It is the way that can clarify the structure of an ultra-group quicker than having just a list of elements.
</summary>
<dc:date>2019-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>The sparing number of the powers of certain Mycielski graphs</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/188495" rel="alternate"/>
<author>
<name>Sudev, N.K.</name>
</author>
<author>
<name>Chithra, K.P.</name>
</author>
<author>
<name>Germina, K.A.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/188495</id>
<updated>2023-03-02T23:27:10Z</updated>
<published>2019-01-01T00:00:00Z</published>
<summary type="text">The sparing number of the powers of certain Mycielski graphs
Sudev, N.K.; Chithra, K.P.; Germina, K.A.
In this paper, we discuss the sparing number of the power graphs of the Mycielski graphs of certain graph classes.
</summary>
<dc:date>2019-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>On NSP constants of a matrix and their linear preservers</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/188494" rel="alternate"/>
<author>
<name>Skrzyński, M.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/188494</id>
<updated>2023-03-02T23:27:05Z</updated>
<published>2019-01-01T00:00:00Z</published>
<summary type="text">On NSP constants of a matrix and their linear preservers
Skrzyński, M.
We collect some basic properties of NSP constants of a matrix, discuss an additive behavior of the spark, and prove two theorems characterizing linear endomorphisms which preserve the NSP constants.
</summary>
<dc:date>2019-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Adjoint functors, preradicals and closure operators in module categories</title>
<link href="http://dspace.nbuv.gov.ua:80/handle/123456789/188493" rel="alternate"/>
<author>
<name>Kashu, A.I.</name>
</author>
<id>http://dspace.nbuv.gov.ua:80/handle/123456789/188493</id>
<updated>2023-03-02T23:27:19Z</updated>
<published>2019-01-01T00:00:00Z</published>
<summary type="text">Adjoint functors, preradicals and closure operators in module categories
Kashu, A.I.
In this article preradicals and closure operators are studied in an adjoint situation, defined by two covariant functors between the module categories R-Mod and S-Mod. The mappings which determine the relationship between the classes of preradicals and the classes of closure operators of these categories are investigated. The goal of research is to elucidate the concordance (compatibility) of these mappings. For that some combinations of them, consisting of four mappings, are considered and the commutativity of corresponding diagrams (squares) is studied. The obtained results show the connection between considered mappings in adjoint situation.
</summary>
<dc:date>2019-01-01T00:00:00Z</dc:date>
</entry>
</feed>
