Multiple Kronecker Covering Graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
4 pages, 2 figures

Keywords

Combinatorics, Algebraic Topology, 05C10; 05C22; 05C99; 57M10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/75112

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0505135
 http://arxiv.org/abs/math/0505135

Collections

arXiv