Multiple Kronecker Covering Graphs
Combinatorics
2007-05-23 v1 Algebraic Topology
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.
Keywords
Cite
@article{arxiv.math/0505135,
title = {Multiple Kronecker Covering Graphs},
author = {Tomaz Pisanski and Wilfried Imrich},
journal= {arXiv preprint arXiv:math/0505135},
year = {2007}
}
Comments
4 pages, 2 figures