Metraipolis › archive › dc_fa487929af2b
Constructions of almost controllable graphs determined by their generalized spectra — arXiv:2608.12919
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.12919
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:48:05.184Z
- SHA-256 of the archived text
659d45d547bdd3bb44a51c6146b01abc3edf2ecdc7b174f2a6a76f32477c7b45- Stable URL of this page
https://metraipolis.com/documento/dc_fa487929af2b
How to cite
Constructions of almost controllable graphs determined by their generalized spectra — arXiv:2608.12919 — arXiv (en), https://arxiv.org/abs/2608.12919 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fa487929af2b (Metraipolis archive dc_fa487929af2b, sha256 659d45d547bdd3bb44a51c6146b01abc3edf2ecdc7b174f2a6a76f32477c7b45)
BibTeX
@misc{dcfa487929af2b,
title = {Constructions of almost controllable graphs determined by their generalized spectra — arXiv:2608.12919},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.12919},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fa487929af2b; sha256 659d45d547bdd3bb44a51c6146b01abc3edf2ecdc7b174f2a6a76f32477c7b45},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12919. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.12919 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T04:28:16.163Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).