Radii and centers in iterated line digraphs
暂无分享,去创建一个
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.
[1] Martin Knor,et al. Distances in iterated line graphs , 1996, Ars Comb..
[2] Miguel Angel Fiol,et al. Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.
[3] Frank Harary,et al. Distance in graphs , 1990 .
[4] M. Aigner. On the linegraph of a directed graph , 1967 .
[5] M. Knor. CENTERS IN ITERATED LINE GRAPHS , 1992 .
[6] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .