Generalized Spectral Characterization of Signed Trees

Let $T$ be a tree with an irreducible characteristic polynomial $\phi(x)$ over $\mathbb{Q}$. Let $\Delta(T)$ be the discriminant of $\phi(x)$. It is proved that if $2^{-\frac n2}\sqrt{\Delta(T)}$ (which is always an integer) is odd and square free, then every signed tree with underlying graph $T$ is determined by its generalized spectrum.

Authors

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2025-04-24
DOI
https://doi.org/10.37236/12423
Citations
3
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
12.26

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalized Spectral Characterization of Signed Trees

Yizhe Ji, Hao Zhang, Wei Wang
3 citations
The Electronic Journal of Combinatorics
Graph theory and applications
12.26
article

Generalized Spectral Characterization of Signed Trees

Yizhe Ji, Hao Zhang, Wei Wang
article en
3 citations

Abstract

Let $T$ be a tree with an irreducible characteristic polynomial $\phi(x)$ over $\mathbb{Q}$. Let $\Delta(T)$ be the discriminant of $\phi(x)$. It is proved that if $2^{-\frac n2}\sqrt{\Delta(T)}$ (which is always an integer) is odd and square free, then every signed tree with underlying graph $T$ is determined by its generalized spectrum.

The Electronic Journal of CombinatoricsVol. 32(2)
National Natural Science Foundation of China, East China University of Science and Technology, Natural Science Foundation of Hunan Province, National Key Research and Development Program of China, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 2%
Graph theory and applications
12.26
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.