Multiple Kronecker Covering Graphs
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.