共 50 条
Distances in iterated line graphs
被引:0
|作者:
Niepel, L
Knor, M
Soltes, L
机构:
[1] COMENIUS UNIV BRATISLAVA, FAC MATH & PHYS, DEPT MATH APPL, BRATISLAVA 84215, SLOVAKIA
[2] SLOVAK UNIV TECHNOL BRATISLAVA, FAC CIVIL ENGN, DEPT MATH, BRATISLAVA 81368, SLOVAKIA
[3] SLOVAK UNIV TECHNOL BRATISLAVA, FAC CHEM TECHNOL, DEPT MATH, BRATISLAVA 81237, SLOVAKIA
来源:
关键词:
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
For a connected graph G that is not a cycle, a path or a claw, let its k-iterated line graph have the diameter diam(k) and the radius r(k). Then diam(k+1) = diam(k) + 1 for sufficiently large k. Moreover, {r(k)} also tends to infinity and the sequence {diam(k) - r(k) - root 2log(2)k} is bounded.
引用
收藏
页码:193 / 202
页数:10
相关论文