  Graph condensation (GC) is an emerging technique designed to learn a
significantly smaller graph that retains the essential information of the
original graph. This condensed graph has shown promise in accelerating graph
neural networks while preserving performance comparable to those achieved with
the original, larger graphs. Additionally, this technique facilitates
downstream applications such as neural architecture search and enhances our
understanding of redundancy in large graphs. Despite the rapid development of
GC methods, a systematic evaluation framework remains absent, which is
necessary to clarify the critical designs for particular evaluative aspects.
Furthermore, several meaningful questions have not been investigated, such as
whether GC inherently preserves certain graph properties and offers robustness
even without targeted design efforts. In this paper, we introduce GC-Bench, a
comprehensive framework to evaluate recent GC methods across multiple
dimensions and to generate new insights. Our experimental findings provide a
deeper insights into the GC process and the characteristics of condensed
graphs, guiding future efforts in enhancing performance and exploring new
applications. Our code is available at
\url{https://github.com/Emory-Melody/GraphSlim/tree/main/benchmark}.
