Multiple Kronecker covering graphs

From MaRDI portal




Abstract: A 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.









This page was built for publication: Multiple Kronecker covering graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925013)