: One LLM Token for Explicit Graph Structural Understanding
Jingyao Wu, Bin Lu, Zijun Di, Xiaoying Gan, Meng Jin, Luoyi Fu, Xinbing Wang, Chenghu Zhou
Abstract
Large language models show great potential in unstructured data understanding, but still face significant challenges with graphs due to their structural hallucination. Existing approaches mainly either verbalize graphs into natural language, which leads to excessive token consumption and scattered attention, or transform graphs into trainable continuous embeddings (i.e., soft prompt), but exhibit severe misalignment with original text tokens. To solve this problem, we propose to incorporate one special token <SO> to fully represent the Structure Of Graph within a unified token space, facilitating explicit topology input and structural information sharing. Specifically, we propose a topology-aware structural tokenizer that maps each graph topology into a highly selective single token. Afterwards, we construct a set of hybrid structure Question-Answering corpora to align new structural tokens with existing text tokens. With this approach, <SO> empowers LLMs to understand, generate, and reason in a concise and accurate manner. Extensive experiments on five graph-level benchmarks demonstrate the superiority of our method, achieving a performance improvement of 9.9–41.4% compared to the baselines while exhibiting interpretability and consistency. Furthermore, our method provides a flexible extension to node-level tasks, enabling both global and local structural understanding. The codebase is publicly available.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7256b659-4e34-4b3c-8b32-fbe72d91bddbCited by top-tier papers2
- Rethinking Efficient Graph Coarsening via a Non-Selfishness PrincipleXu Bai, Bin Lu, kunzhang, Shengbo Chen et al.ICML 2026
- SLASH the Sink: Sharpening Structural Attention Inside LLMsYiming Liu, Bin Lu, Xinbing Wang, Chenghu Zhou et al.ICML 2026
Builds on27
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- Training language models to follow instructions with human feedbackLong Ouyang, Jeffrey Wu, Xu Jiang, Diogo Almeida et al.NeurIPS 2022 · 24,707 citations
- LoRA: Low-Rank Adaptation of Large Language ModelsEdward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu et al.ICLR 2022 · 18,833 citations
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
Related papers
- Search-on-Graph: Iterative Informed Navigation for Large Language Model Reasoning on Knowledge GraphsJia Ao Sun, Hao Yu, Fabrizio Gotti, Fengran Mo et al.KDD 2026 · 8 citations
- GRASP: Graph Reasoning via Agentic Solving and Probing of LLMsXiaojun Guo, Mingxue Tian, Chenheng Zhang, Xiaohan Wang et al.ICML 2026
- GRIP: In-Parameter Graph Reasoning through Fine-Tuning Large Language ModelsJiarui Feng, Donghong Cai, Yixin Chen, Muhan ZhangKDD 2026 · 2 citations
- Digest the Knowledge: Large Language Models empowered Message Passing for Knowledge Graph Question AnsweringJunhong Wan, Tao Yu, Kunyu Jiang, Yao Fu et al.ACL 2025 · 4 citations
- Making Large Language Models Perform Better in Knowledge Graph CompletionYichi Zhang, Zhuo Chen, Lingbing Guo, Yajing Xu et al.ACM MM 2024 · 86 citations
