list of integers
The IsGraphicSequence command returns true if there exists a graph with the specified degree sequence given as input. It returns false otherwise. The strategy is to verify some inequalities due to Erdős, Gallai (1960). A refinement due to Tripathi, Vijai (2003) is implemented which makes the algorithm faster.
To construct a graph with given degree sequence, use SequenceGraph.
L ≔ 3,2,4,2,3,4,5,7
G ≔ SequenceGraph⁡L
G≔Graph 1: an undirected unweighted graph with 8 vertices and 15 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)