On anti-stochastic properties of unlabeled graphs

DOI10.1007/978-3-031-15914-5_22arXiv2112.04395OpenAlexW4312858413MaRDI QIDQ6039431

Sergei Kiselev, Oleg Verbitsky, Andrey B. Kupavskii, M. E. Zhukovskii

Publication date: 5 May 2023

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.04395

zbMATH Keywords

random graphsnetwork resiliencecanonical labeling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unit sphere packings and coverings of the Hamming space
• On the Modular Value and Fractional Part of a Random Variable
• Random Graph Isomorphism
• The degree sequence of a random graph. I. The models
• Coupling Scale-Free and Classical Random Graphs
• Robustness and Vulnerability of Scale-Free Random Graphs
• Characterization of robustness and resilience in graphs: a mini-review
• Alternative Metrics
• Adversarial Deletion in a Scale-Free Random Graph Process
• Asymptotic Enumeration of Hypergraphs by Degree Sequence

This page was built for publication: On anti-stochastic properties of unlabeled graphs