Multiple Kronecker Covering Graphs

Simple item page
dc.creatorPisanski, Tomaz
dc.creatorImrich, Wilfried
dc.date2005-05-08
dc.date.accessioned2026-07-07T05:19:42Z
dc.date.available2026-07-07T05:19:42Z
dc.descriptionA 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.
dc.description4 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0505135
dc.identifierhttp://arxiv.org/abs/math/0505135
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75112
dc.subjectCombinatorics
dc.subjectAlgebraic Topology
dc.subject05C10; 05C22; 05C99; 57M10
dc.titleMultiple Kronecker Covering Graphs
dc.typetext

Files

Collections

arXiv