On Diameter of Line Graphs

Author(s):

Harishchandra S. Ramane , Ivan Gutman , Asha B. Ganagi

Message:
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$.
Keywords:

Line graph , Diameter (of graph) , Distance (in graph)

Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:8 Issue: 1, May 2013
Page:
105
https://www.magiran.com/p1111751