Distances in Iterated Line Graphs

Niepel, L’.; Knor, M.; Soltés, L’.

Abstract

References

Ars Combinatoria

Volume 043
Pages: 193-202

Research article

Distances in Iterated Line Graphs

^¹, ^², ^³

¹Department of Applied Mathemetics Faculty of Mathematics and Physics Comenius University 842 15, Bratislava Slovakia

²Department of Mathematics Faculty of Civil Engineering Slovak Technical Univeristy Radlinského 11 813 68, Bratislava Slovakia

³ Department of Mathematics Faculty of Chemical Technology Slovak Technical University Radlinského 9 812 37, Bratislava Slovakia

Published: 31/08/1996

Download PDF
Cite

Copyright Link
License

Abstract

For a connected graph $G$ that is not a cycle, a path or a claw, let its $k$ -iterated line graph have the diameter $d i a m_{k}$ , and the radius $r_{k}$ . Then $d i a m_{k + 1} = d i a m_{k} + 1$ for sufficiently large $k$ . Moreover, ${r_{k}}$ also tends to infinity and the sequence ${d i a m_{k} - r_{k} - \sqrt{2 \log_{2} k}}$ is bounded.

Contents

Ars Combinatoria

Distances in Iterated Line Graphs

Abstract

Information

Guidelines

CP Initiatives

Follow CP