We consider the rank of the adjacency matrix of the line graph for some classes of regular graphs. In particular, we study the line graphs of cycles, paths, complete graphs, complete bipartite and multipartite graphs, circulant graphs of degrees three and four, and some Cartesian graph products.