| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654814 | European Journal of Combinatorics | 2008 | 7 Pages |
Abstract
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 non-unique minimal regular common covers.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Wilfried Imrich, Tomaž Pisanski,