RT - Journal Article T1 - On Diameter of Line Graphs JF - IJMSI YR - 2013 JO - IJMSI VO - 8 IS - 1 UR - http://ijmsi.ir/article-1-407-en.html SP - 105 EP - 109 K1 - Line graph K1 - Diameter (of graph) K1 - Distance (in graph). AB - The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$. LA eng UL http://ijmsi.ir/article-1-407-en.html M3 10.7508/ijmsi.2013.01.010 ER -