A Survey on Structure-Preserving Graph Transformers
Not on the map. Why?
Abstract (arXiv)
The transformer architecture has shown remarkable success in various domains, such as natural language processing and computer vision. When it comes to graph learning, transformers are required not only to capture the interactions between pairs of nodes but also to preserve graph structures connoting the underlying relations and proximity between them, showing the expressive power to capture different graph structures. Accordingly, various structure-preserving graph transformers have been proposed and widely used for various tasks, such as graph-level tasks in bioinformatics and chemoinformatics. However, strategies related to graph structure preservation have not been well organized and systematized in the literature. In this paper, we provide a comprehensive overview of structure-preserving graph transformers and generalize these methods from the perspective of their design objective. First, we divide strategies into four main groups: node feature modulation, context node sampling, graph rewriting, and transformer architecture improvements. We then further divide the strategies according to the coverage and goals of graph structure preservation. Furthermore, we also discuss challenges and future directions for graph transformer models to preserve the graph structure and understand the nature of graphs.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 29 of its 40 references that are in the map. First posted on arXiv 29 Jan 2024.
Builds on
29 of 40 references.
References · 29
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
- 2020Benchmarking Graph Neural Networkscited by 680
- 2020A Generalization of Transformer Networks to Graphscited by 661
- 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 506
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 473
- 2021Graph Neural Networks with Learnable Structural and Positional Representationscited by 333
- 2022Representing Long-Range Context for Graph Neural Networks with Global Attentioncited by 195
- 2022Structure-Aware Transformer for Graph Representation Learningcited by 194
- 2022Pure Transformers are Powerful Graph Learnerscited by 188
- 2022Sign and Basis Invariant Networks for Spectral Graph Representation Learningcited by 179
- 2023Exphormer: Sparse Transformers for Graphscited by 170
- 2023Graph Inductive Biases in Transformers without Message Passingcited by 153
17 more
- 2021GraphiT: Encoding Graph Structure in Transformerscited by 147
- 2022NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphscited by 137
- 2023Rethinking the Expressive Power of GNNs via Graph Biconnectivitycited by 119
- 2021Global Self-Attention as a Replacement for Graph Convolutioncited by 114
- 2022Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvaturecited by 98
- 2022Hierarchical Graph Transformer with Adaptive Node Samplingcited by 72
- 2022GRPE: Relative Positional Encoding for Graph Transformercited by 70
- 2021Gophormer: Ego-Graph Transformer for Node Classificationcited by 63
- 2019Universal Graph Transformer Self-Attention Networkscited by 41
- 2023A Survey on Efficient Training of Transformerscited by 39
- 2023Are More Layers Beneficial to Graph Transformers?cited by 15
- 2023Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similaritycited by 14
- 2022Deformable Graph Transformercited by 7
- 2023Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structurescited by 6
- 2023AGFormer: Efficient Graph Representation with Anchor-Graph Transformercited by 5
- 2023Companion Animal Disease Diagnostics based on Literal-aware Medical Knowledge Graph Representation Learningcited by 4
- 2023Connector 0.5: A unified framework for graph representation learningcited by 3
Built on by
Citing papers per year: 2024: 4; 2025: 3.
7 papers.
- 2024Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classificationcited by 85
- 2025Can Classic GNNs Be Strong Baselines for Graph-level Tasks? Simple Architectures Meet Excellencecited by 26
- 2024Learning Graph Quantized Tokenizerscited by 19
- 2024Node Identifiers: Compact, Discrete Representations for Efficient Graph Learningcited by 10
- 2025Invariant Graph Transformer for Out-of-Distribution Generalizationcited by 2
- 2025Exploring Graph-Transformer Out-of-Distribution Generalization Abilitiescited by 1
- 2024Learning to Model Graph Structural Information on MLPs via Graph Structure Self-Contrastingcited by 0
- 2025Invariant Graph Transformer for Out-of-Distribution Generalization1 Aug 2025
- 2025Exploring Graph-Transformer Out-of-Distribution Generalization Abilities25 Jun 2025
- 2025Can Classic GNNs Be Strong Baselines for Graph-level Tasks? Simple Architectures Meet Excellence13 Feb 2025
- 2024Learning Graph Quantized Tokenizers17 Oct 2024
- 2024Learning to Model Graph Structural Information on MLPs via Graph Structure Self-Contrasting9 Sep 2024
- 2024Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification13 Jun 2024
- 2024Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning26 May 2024