Some problems in the enumeration of labelled graphs

Nicholas C. Wormald

doi:10.1017/S0004972700011436

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Gounaris, Chrysanthos E. Rajendran, Karthikeyan Kevrekidis, Ioannis G. and Floudas, Christodoulos A. 2011. Generation of networks with prescribed degree-dependent clustering. Optimization Letters, Vol. 5, Issue. 3, p. 435.

A. Bold, Katherine Rajendran, Karthikeyan Ráth, Balázs and G. Kevrekidis, Ioannis 2014. An equation-free approach to coarse-graining the dynamics of networks. Journal of Computational Dynamics, Vol. 1, Issue. 1, p. 111.

Joos, Felix Perarnau, Guillem Rautenbach, Dieter and Reed, Bruce 2016. How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. p. 695.

Shafie, Termeh 2016. Analyzing local and global properties of multigraphs. The Journal of Mathematical Sociology, Vol. 40, Issue. 4, p. 239.

Gounaris, Chrysanthos E. Rajendran, Karthikeyan Kevrekidis, Ioannis G. and Floudas, Christodoulos A. 2016. Designing networks: A mixed‐integer linear optimization approach. Networks, Vol. 68, Issue. 4, p. 283.

Cook, Nicholas A. 2017. Discrepancy properties for random regular digraphs. Random Structures & Algorithms, Vol. 50, Issue. 1, p. 23.

Joos, Felix Perarnau, Guillem Rautenbach, Dieter and Reed, Bruce 2018. How to determine if a random graph with a fixed degree sequence has a giant component. Probability Theory and Related Fields, Vol. 170, Issue. 1-2, p. 263.

Voitalov, Ivan van der Hoorn, Pim van der Hofstad, Remco and Krioukov, Dmitri 2019. Scale-free networks well done. Physical Review Research, Vol. 1, Issue. 3,

Vial, Daniel and Subramanian, Vijay 2019. A Structural Result for Personalized PageRank and its Algorithmic Consequences. Proceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 3, Issue. 2, p. 1.

van der Hofstad, Remco van der Hoorn, Pim Litvak, Nelly and Stegehuis, Clara 2020. Limit theorems for assortativity and clustering in null models for scale-free networks. Advances in Applied Probability, Vol. 52, Issue. 4, p. 1035.

Ávila-Ayala, Rocío M. and Ramírez-Ramírez, L. Leticia 2020. Proceedings of the Thirteenth International Conference on Management Science and Engineering Management. Vol. 1001, Issue. , p. 457.

Pilipczuk, Michał and Siebertz, Sebastian 2021. Kernelization and approximation of distance-r independent sets on nowhere dense graphs. European Journal of Combinatorics, Vol. 94, Issue. , p. 103309.

Enriquez, Nathanaël Faraud, Gabriel Ménard, Laurent and Noiry, Nathan 2022. Depth first exploration of a configuration model. Electronic Journal of Probability, Vol. 27, Issue. none,

Liebenau, Anita and Wormald, Nick 2023. Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. Random Structures & Algorithms, Vol. 62, Issue. 2, p. 259.

Demin, Danila and Zhukovskii, Maksim 2024. First order complexity of finite random structures. p. 1.

Article contents

Some problems in the enumeration of labelled graphs

Abstract

Information

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests