[42] R. A. Horn and C. R. Johnson, Matrix analysis. New York: Cambridge university press, 2012.
[43] M. De León and P. R. Rodrigues, Generalized Classical Mechanics and Field Theory: a geometrical approach of Lagrangian and Hamiltonian formalisms involving higher order derivatives. Elsevier, 2011.
[44] W. Curtin and H. Scher, "Mechanics modeling using a spring network," J. Mater. Research, vol. 5, no. 3, pp. 554-562, 1990.
[45] A. C. Da Silva and A. C. Da Salva, Lectures on symplectic geometry. Springer, 2008, vol. 3575.
[46] V. I. Arnold, V. V. Kozlov, and A. I. Neishtadt, Mathematical aspects of classical and celestial mechanics. Springer Science & Business Media, 2007, vol. 3.
[47] P. Velicković, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks,” in Proc. Int. Conf. Learn. Representations, 2018, pp. 1–12.
[48] W. L. Hamilton, R. Ying, and J. Leskovec, "Inductive representation learning on large graphs," in Advances Neural Inf. Process. Syst., 2017.
[49] Y. Chen, H. Yang, Y. Zhang, K. Ma, T. Liu, B. Han, and J. Cheng, “Understanding and improving graph injection attack by promoting unnoticeability,” in Proc. Int. Conf. Learn. Representations, 2022.
[50] A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu, "Towards deep learning models resistant to adversarial attacks," in Proc. Int. Conf. Learn. Representations, 2018.
[51] Z. Yang, W. Cohen, and R. Salakhudinov, “Revisiting semi-supervised learning with graph embeddings,” in Proc. Int. Conf. Mach. Learn., 2016, pp. 40–48.
[52] O. Shchur, M. Mumme, A. Bojchevski, and S. Gunnemann, "Pitfalls of graph neural network evaluation," Relational Representation Learning Workshop, Advances Neural Inf. Process. Syst., 2018.
[53] W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, "Open graph benchmark: Datasets for machine learning on graphs," Advances Neural Inf. Process. Syst., vol. 33, pp. 22 118-22 133, 2020.
[54] Q. Zheng, X. Zou, Y. Dong, Y. Cen, D. Yin, J. Xu, Y. Yang, and J. Tang, “Graph robustness benchmark: Benchmarking the adversarial robustness of graph machine learning,” Advances Neural Inf. Process. Syst. Track Datasets Benchmarks, 2021.
[55] W. Jin, Y. Ma, X. Liu, X. Tang, S. Wang, and J. Tang, "Graph structure learning for robust graph neural networks," in Proc. Int. Conf. Knowl. Discovery Data Mining, 2020, pp. 66-74.
[56] Y. Li, W. Jin, H. Xu, and J. Tang, "Deeprobust: A pytorch library for adversarial attacks and defenses," arXiv preprint arXiv:2005.06149, 2020.
[57] D. Zhu, Z. Zhang, P. Cui, and W. Zhu, "Robust graph convolutional networks against adversarial attacks," in Proc. Int. Conf. Knowl. Discovery Data Mining, 2019, pp. 1399-1407.
[58] N. Entezari, S. A. Al-Sayouri, A. Darvishzadeh, and E. E. Papalexakis, "All you need is low (rank): Defending against adversarial attacks on graphs," in Proc. Int. Conf. Web Search Data Mining, 2020, p. 169-177.
[59] L. A. Adamic and N. Glance, “The political blogosphere and the 2004 us election: divided they blog,” in Proc. Int. Workshop Link Discovery, 2005, pp. 36–43.
[60] A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu, "Towards deep learning models resistant to adversarial attacks," arXiv preprint arXiv:1706.06083, 2017.
[61] X. Zhang and M. Zitnik, "Gnnguard: Defending graph neural networks against adversarial attacks," Advances Neural Inf. Process. Syst., vol. 33, pp. 9263-9275, 2020.
[62] OpenAI, "Chatgpt-4," 2022, available at: https://www.openai.com (Accessed: 26 September 2023).
[63] Y. Ma, S. Wang, T. Derr, L. Wu, and J. Tang, "Graph adversarial attack via rewiring," in Proc. Int. Conf. Knowl. Discovery Data Mining, 2021, p. 1161-1169.
[64] Y. Sun, S. Wang, X. Tang, T.-Y. Hsieh, and V. Honavar, "Adversarial attacks on graph neural networks via node injections: A hierarchical reinforcement learning approach," in Proc. Web Conf., 2020, p. 673-683.