Radii and centers in iterated line digraphs
Discussiones Mathematicae Graph Theory (1996)
- Volume: 16, Issue: 1, page 17-26
- ISSN: 2083-5892
Access Full Article
top
Abstract
topHow to cite
topMartin Knor, and L'udovít Niepel. "Radii and centers in iterated line digraphs." Discussiones Mathematicae Graph Theory 16.1 (1996): 17-26. <http://eudml.org/doc/270161>.
@article{MartinKnor1996,
abstract = {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.},
author = {Martin Knor, L'udovít Niepel},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {center; digraph; line digraph; radius; out-radius; iterated line digraphs},
language = {eng},
number = {1},
pages = {17-26},
title = {Radii and centers in iterated line digraphs},
url = {http://eudml.org/doc/270161},
volume = {16},
year = {1996},
}
TY - JOUR
AU - Martin Knor
AU - L'udovít Niepel
TI - Radii and centers in iterated line digraphs
JO - Discussiones Mathematicae Graph Theory
PY - 1996
VL - 16
IS - 1
SP - 17
EP - 26
AB - 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.
LA - eng
KW - center; digraph; line digraph; radius; out-radius; iterated line digraphs
UR - http://eudml.org/doc/270161
ER -
References
top- [1] M. Aigner, On the linegraph of a directed graph, Math. Z. 102 (1967) 56-61, doi: 10.1007/BF01110285. Zbl0158.20901
- [2] L.W. Beineke and R.J. Wilson, Selected Topics in Graph Theory (Academic Press, London, 1978).
- [3] F. Buckley and F. Harary, Distance in Graphs (Addison-Wesley, Reading, 1990). Zbl0688.05017
- [4] M.A. Fiol, J.L.A. Yebra and I. Alegre, Line digraph iterations and the (d,k) digraph problem, IEEE Trans. Comput. C-33 (1984) 400-403, doi: 10.1109/TC.1984.1676455. Zbl0528.68048
- [5] M. Knor, L'. Niepel and L'. Soltés, Centers in Iterated Line Graphs, Acta Math. Univ. Comenianae LXI, 2 (1992) 237-241.
- [6] M. Knor, L'. Niepel and L'. Soltés, Distances in Iterated Line Graphs, Ars Combin. (to appear).
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.