That is, if given a non-negative integer sequence, are we sure that we can draw a simple graph according to it.? Let's put forward such a definition: provided that a non-negative integer sequence is ...

Gao, Pu , and Nicholas Wormald. 2016. “Enumeration Of Graphs With A Heavy-Tailed Degree Sequence”. Advances In Mathematics 287: 412–450.

Project Overview This project provides an interactive visualization of two non-isomorphic graphs that share the same degree sequence of (3, 2, 2, 1). It uses HTML and JavaScript with the Cytoscape ...

‘Double edge swaps’ transform one graph into another while preserving the graph's degree sequence, and have thus been used in a number of popular Markov chain Monte Carlo (MCMC) sampling techniques.

Abstract: The degree sequence of an n-vertex graph is d/sub 0/, ..., d/sub n - 1/, where each d/sub i/ is the number of vertices of degree i in the graph. A random graph with degree sequence d/sub 0/, ...

Arman, Andrii , Pu Gao, and Nicholas Wormald. 2019. “Fast Uniform Generation Of Random Graphs With Given Degree Sequences”. Arxiv Preprint Arxiv:1905.03446.