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 ...

Step 3: Use the Havel-Hakimi algorithm to determine whether a simple graph can be constructed from the sequence, and to generate the graph. Step 4: If the graph is successfully created, visualize it ...

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

The traditional Erdos-Renyi model of a random network is of little use in modelling the type of complex networks which modern researchers study. In this graph, every pair of vertices is equally likely ...

Bailey K. Fosdick, Daniel B. Larremore, Joel Nishimura, Johan Ugander, Configuring Random Graph Models with Fixed Degree Sequences, SIAM Review, Vol. 60, No. 2 (June ...

With the wide application of computer technology in chemical research, the research on the relationship between harmonic index and graph invariants expands the practical application of graph theory ...