Do we generally store the degree of each vertex in the linked list implementation? if not, why?
Normally we don't; the adjacency list representation is a list of out-edges, but doesn't separately store the degree.  However, you can certainly store that additional information if you want.  You can choose how you want to represent the graph, and it's not hard to modify the standard data structure to keep track of the out-degree of each vertex.