Dataset of Graph Invariants for 100 Edros - Renyi Random Graphs

This dataset contains 100 Erdős–Rényi random graphs, each with 15 nodes and a probability of edge formation , generated using the NetworkX library in Python. For each graph, key structural invariants were computed and recorded, including: Number of nodes Number of edges Chromatic number (approximated using greedy coloring) Graph diameter (where applicable) Average degree Degree sequence Connectivity status The data is stored in a single CSV file (graph_dataset.csv), where each row represents one graph and its computed properties. Disconnected graphs are retained for completeness, and for these cases, the diameter is marked as "NA". This dataset can be used in a wide range of applications including: Graph theory research Machine learning model development for graph-based prediction Algorithm benchmarking (e.g., graph coloring, isomorphism detection) Educational purposes and Python-based graph theory training A Python script (generate_dataset.py) is also included to allow reproducibility or extension of this dataset with different parameters.