The cyclic subgroup graph \(\varvec{\Gamma }(\mathscr {G})\) of a group \(\mathscr {G}\) is the graph with vertices are cyclic subgroups of \(\mathscr {G}\) and two distinct vertices \(\mathcal {H}_1\) and \(\mathcal {H}_2\) are adjacent if and only if \(\mathcal {H}_1 \le \mathcal {H}_2\) and there does not exist any cyclic subgroup \(\mathcal {K}\) such that \(\mathcal {H}_1< \mathcal {K} < \mathcal {H}_2\) . In this paper, we classify all the finite groups \(\mathscr {G}\) such that \(\varvec{\Gamma }(\mathscr {G})\) is the line graph of some graph.