Graph Domain Adaptation (GDA) transfers knowledge from labeled source graphs to unlabeled target graphs, addressing the challenge of label scarcity. However, existing GDA methods typically assume that both source and target graphs exhibit homophily, leading existing methods to perform poorly when heterophily is present. Furthermore, the lack of labels in the target graph makes it impossible to assess its homophily level beforehand. To address this challenge, we propose a novel homophily-agnostic approach that effectively transfers knowledge between graphs with varying degrees of homophily. Specifically, we adopt a divide-and-conquer strategy that first separately reconstructs highly homophilic and heterophilic variants of both the source and target graphs, and then performs knowledge alignment separately between corresponding graph variants. Extensive experiments conducted on five benchmark datasets demonstrate the superior performance of our approach, particularly highlighting its substantial advantages on heterophilic graphs.
@article{arxiv.2602.07573,
title = {Graph Domain Adaptation via Homophily-Agnostic Reconstructing Structure},
author = {Ruiyi Fang and Shuo Wang and Ruizhi Pu and Qiuhao Zeng and Hao Zheng and Ziyan Wang and Jiale Cai and Zhimin Mei and Song Tang and Charles Ling and Boyu Wang},
journal= {arXiv preprint arXiv:2602.07573},
year = {2026}
}