Multiple Kronecker covering graphs

A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon and apply it to show that the minimal common cover of two graphs need not be unique. We provide examples of graphs of the same size with non-unique common double covers and of isovalent graphs of the same size with nonunique minimal regular common covers.

• Type: Journal
• Year: 2008
• Where: EJC
• Authors: Wilfried Imrich, Tomaz Pisanski
• Keywords: Common Double Covers, EJC 2007, EJC 2008, Information Technology, Kronecker Cover, Minimal Common Cover