ArticleOriginal scientific text
Title
Radii and centers in iterated line digraphs
Authors 1, 2
Affiliations
- Slovak Technical University, Faculty of Civil Engineering, Department of Mathematics
- Comenius University, Faculty of Mathematics and Physics
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.
Keywords
center, digraph, line digraph, radius
Bibliography
- M. Aigner, On the linegraph of a directed graph, Math. Z. 102 (1967) 56-61, doi: 10.1007/BF01110285.
- L.W. Beineke and R.J. Wilson, Selected Topics in Graph Theory (Academic Press, London, 1978).
- F. Buckley and F. Harary, Distance in Graphs (Addison-Wesley, Reading, 1990).
- 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.
- M. Knor, L'. Niepel and L'. Soltés, Centers in Iterated Line Graphs, Acta Math. Univ. Comenianae LXI, 2 (1992) 237-241.
- M. Knor, L'. Niepel and L'. Soltés, Distances in Iterated Line Graphs, Ars Combin. (to appear).