Multiple Kronecker Covering Graphs
classification
🧮 math.CO
math.AT
keywords
covergraphskroneckerapproachcommoncoveringexploregraph
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.