Bounds for the minimum oriented diameter

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We consider the problem of finding an orientation with minimum diameter of a connected bridgeless graph. Fomin et. al. discovered a relation between the minimum oriented diameter an the size of a minimal dominating set. We improve their upper bound.
21 pages, 6 figures

Keywords

Combinatorics, 05C12 (Primary);05C20,05C69 (Secondary)

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0804.1294
 http://arxiv.org/abs/0804.1294

Collections

arXiv