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

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.