Use this if you are using igraph from R
is_degseq
checks whether the given vertex degrees (in and
outdegrees for directed graphs) can be realized by a graph. Note that the
graph does not have to be simple, it may contain loop and multiple edges.
For undirected graphs, it also checks whether the sum of degrees is even.
For directed graphs, the function checks whether the lengths of the two
degree vectors are equal and whether their sums are also equal. These are
known sufficient and necessary conditions for a degree sequence to be valid.
is_degseq(out.deg, in.deg = NULL)
out.deg 
Integer vector, the degree sequence for undirected graphs, or the outdegree sequence for directed graphs. 
in.deg 

A logical scalar.
Tamas Nepusz ntamas@gmail.com
Hakimi SL: On the realizability of a set of integers as degrees of the vertices of a simple graph. J SIAM Appl Math 10:496506, 1962.
PL Erdos, I Miklos and Z Toroczkai: A simple HavelHakimi type algorithm to realize graphical degree sequences of directed graphs. The Electronic Journal of Combinatorics 17(1):R66, 2010.
Other graphical degree sequences:
is_graphical()
g < sample_gnp(100, 2/100) is_degseq(degree(g)) is_graphical(degree(g))