Let $H$ be a simple undirected graph and $G=\mathrm{L}(H)$ be its line graph. Assume that $Δ(G)$ denotes the clique complex of $G$. We show that $Δ(G)$ is sequentially Cohen-Macaulay if and only if it is shellable if and only if it is vertex decomposable. Moreover if $Δ(G)$ is pure, we prove that these conditions are also equivalent to being strongly connected. Furthermore, we state a complete characterizations of those $H$ for which $Δ(G)$ is Cohen-Macaulay, sequentially Cohen-Macaulay or Gorenstein. We use these characterizations to present linear time algorithms which take a graph $G$, check whether $G$ is a line graph and if yes, decide if $Δ(G)$ is Cohen-Macaulay or sequentially Cohen-Macaulay or Gorenstein.