On perfect codes in the dual­pancake graphs and complexity of congruence-classes in regular varieties

On perfect codes in the dualpancake graphs and complexity of congruence-classes in regular varieties

dc.contributor.author	Mamedov, Oktay	en
dc.contributor.author	Mehdiyev, Hicran	en
dc.date.accessioned	2016-01-21T12:02:10Z
dc.date.available	2016-01-21T12:02:10Z
dc.date.issued	2014
dc.description.abstract	Here we define dual-pancake graphs and consider perfect codes in dual-pancake graphs. We find the existence of perfect codes in the dual-pancake graphs and consider some properties of them. In the second part we investigate complexity of congruence classes of algebras in some varieties.	en
dc.identifier.citation	Mamedov, O. On perfect codes in the dualpancake graphs and complexity of congruence-classes in regular varieties [Текст] / Oktay Mamedov, Hicran Mehdiyev // Proceedings of the ninth international scientific-practical conference "Internet-Education-Science" (IES-2014), Vinnytsia, 14 - 17 October, 2014. - Vinnytsia : VNTU, 2014. - С. 148-149.	en
dc.identifier.udc	519.1
dc.identifier.uri	http://ir.lib.vntu.edu.ua/handle/123456789/4788
dc.language.iso	en	en
dc.publisher	Вінницький національний технічний університет	uk
dc.title	On perfect codes in the dualpancake graphs and complexity of congruence-classes in regular varieties	en
dc.type	Thesis

Зараз показуємо 1 - 1 з 1

Зараз показуємо 1 - 1 з 1