2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/75112A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be unique.4 pages, 2 figuresCombinatoricsAlgebraic Topology05C10; 05C22; 05C99; 57M10text