This documents the development version of NetworkX. Documentation for the current release can be found here.
Returns True if some pseudograph can realize the sequence.
Every nonnegative integer sequence with an even sum is pseudographical (see ).
- sequencelist or iterable container
A sequence of integer node degrees
True if the sequence is a pseudographic degree sequence and False if not.
The worst-case run time is \(O(n)\) where n is the length of the sequence.
F. Boesch and F. Harary. “Line removal algorithms for graphs and their degree lists”, IEEE Trans. Circuits and Systems, CAS-23(12), pp. 778-782 (1976).