Back to Search Start Over

Multiple Kronecker covering graphs

Authors :
Imrich, Wilfried
Pisanski, Tomaž
Source :
European Journal of Combinatorics. Jul2008, Vol. 29 Issue 5, p1116-1122. 7p.
Publication Year :
2008

Abstract

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. [Copyright &y& Elsevier]

Details

Language :
English
ISSN :
01956698
Volume :
29
Issue :
5
Database :
Academic Search Index
Journal :
European Journal of Combinatorics
Publication Type :
Academic Journal
Accession number :
31895772
Full Text :
https://doi.org/10.1016/j.ejc.2007.07.001