<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/150381">
<title>Algebra and Discrete Mathematics, 2014, Vol. 17, Vol. 18</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/150381</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/158467"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153355"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153354"/>
<rdf:li rdf:resource="http://dspace.nbuv.gov.ua:80/handle/123456789/153353"/>
</rdf:Seq>
</items>
<dc:date>2026-04-09T12:55:12Z</dc:date>
</channel>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/158467">
<title>Igor Volodymyrovych Protasov (dedicated to 60-th Birthday)</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/158467</link>
<description>Igor Volodymyrovych Protasov (dedicated to 60-th Birthday)
</description>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153355">
<title>On elements of high order in general finite fields</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153355</link>
<description>On elements of high order in general finite fields
Popovych, R.
</description>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153354">
<title>The endomorphisms monoids of graphs of order n with a minimum degree n − 3</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153354</link>
<description>The endomorphisms monoids of graphs of order n with a minimum degree n − 3
Pipattanajinda, N.; Knauer, U.; Gyurov, B.; Panma, S.
We characterize the endomorphism monoids, End(G), of the generalized graphs G of order n with a minimum degree n − 3. Criteria for regularity, orthodoxy and complete regularity of those monoids based on the structure of G are given.
</description>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
<item rdf:about="http://dspace.nbuv.gov.ua:80/handle/123456789/153353">
<title>A nilpotent non abelian group code</title>
<link>http://dspace.nbuv.gov.ua:80/handle/123456789/153353</link>
<description>A nilpotent non abelian group code
Nebe, G.; Schäfer, A.
The paper reports an example for a nilpotent group code which is not monomially equivalent to some abelian group code.
</description>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
