Let be a connected graph with at least three vertices. The -line graph, , of a graph has all the edges of as its vertices, two vertices of are adjacent if the corresponding edges in are adjacent and belong to a common copy of . In this paper we investigate some properties of the star-line graph of a graph . We also obtain a Krausz type characterization for star-line graphs. Traversability of star-line graphs is also studied.