Constructions of almost controllable graphs determined by their generalized spectra

Abstract

Identifying and constructing graphs that are determined by their generalized spectrum (DGS) is a significant and challenging problem in spectral graph theory. Recently, a simple criterion for almost controllable graphs to be DGS was proposed by Lin et al. (2026), utilizing the modified walk matrix. In this paper, we investigate the evolution of the modified walk matrix under disjoint union and join operations with a singleton vertex. We establish an exact algebraic identity for the determinant of the modified walk matrix of the resulting graph. Based on this identity and the DGS-criterion of Lin et al., we construct infinite families of almost controllable graphs that are DGS, extending the previous construction of Liu et al. (2019), which was restricted to controllable graphs.

Disclosure

“eorem 1.6. Acknowledgments This work is partially supported by the National Natural Science Foundation of China (Grant No. 12001006) and Wuhu Science and Technology Project, China (Grant No. 2024kj015). The authors acknowledge the use of Gemini 3.1 Pro for language polishing and detailed proofreading of the manuscript. References [1] D. Cvetković, P. Rowlinson, S. Simić, An Introduction to the Theory of Graph Spectra, Cambridge University Press, Cambridge, UK, 2010. [2] E. R.”

PDF page 11

Classification

Proofreading, grammar, or spelling

Multiplier

1

Verified

2026-08-23T05:12:46.272476Z

Structural counts