TY - JOUR T1 - On Diameter of Line Graphs TT - JF - IJMSI JO - IJMSI VL - 8 IS - 1 UR - http://ijmsi.ir/article-1-407-en.html Y1 - 2013 SP - 105 EP - 109 KW - Line graph KW - Diameter (of graph) KW - Distance (in graph). N2 - 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$. M3 10.7508/ijmsi.2013.01.010 ER -