Title of article
On Diameter of Line Graphs
Author/Authors
Ramane، Harishchandra S. نويسنده Department of Mathematics , , Gutman، Ivan نويسنده , , Ganagi، Asha B. نويسنده Department of Mathematics ,
Issue Information
دوفصلنامه با شماره پیاپی سال 2013
Pages
5
From page
105
To page
109
Abstract
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$.
Journal title
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Serial Year
2013
Journal title
Iranian Journal of Mathematical Sciences and Informatics (IJMSI)
Record number
890201
Link To Document