Degree Sequence for a non-simple graph

Question

How to know that graph is possible or not for a given degree sequence of a Multigraph/Pseudograph ? Is there any algorithm or procedure for a graph which is not simple because Havel-Hakimi Theorem is valid only for simple graph.

Comments

you can try handshaking theorem??

---

Thank you. Will Handshaking Lemma  give correct answer always ? If the sum of all degrees is even or if total no . of odd vertices are even then will it definitely give the non-simple graph ?

---

@ankitgupta if the sum of degree is even you can always have a graph for it, though it may not be simple graph.

---

yes sir , Handshaking Theorem is applicable for both simple and non-simple graph. That's why I have asked that Is any specific method available or not to check non-simple graph.