Radii and centers in iterated line digraphs
Discussiones Mathematicae. Graph Theory, Tome 16 (1996) no. 1, pp. 17-26
Voir la notice de l'article provenant de la source Library of Science
We show that the out-radius and the radius grow linearly, or "almost" linearly, in iterated line digraphs. Further, iterated line digraphs with a prescribed out-center, or a center, are constructed. It is shown that not every line digraph is admissible as an out-center of line digraph.
Keywords:
center, digraph, line digraph, radius
@article{DMGT_1996_16_1_a1,
author = {Knor, Martin and Niepel, L'udov{\'\i}t},
title = {Radii and centers in iterated line digraphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {17--26},
publisher = {mathdoc},
volume = {16},
number = {1},
year = {1996},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_1996_16_1_a1/}
}
Knor, Martin; Niepel, L'udovít. Radii and centers in iterated line digraphs. Discussiones Mathematicae. Graph Theory, Tome 16 (1996) no. 1, pp. 17-26. http://geodesic.mathdoc.fr/item/DMGT_1996_16_1_a1/