Dataset of Graph Invariants for 100 Erdős-Rényi Random Graphs

Abstract

This article presents a dataset of 100 Erdős-Rényi random graphs, each consisting of 15 nodes and an edge probability of 0.2. For each graph, several structural invariants were computed using the NetworkX Python library, including chromatic number (approximated), diameter (if connected), average degree, degree sequence, and connectivity status. The dataset supports research in graph theory, machine learning, algorithm development, and graph-based education. It is publicly available via Mendeley Data at https://doi.org/10.17632/xmmzj7dwr3.1.