Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.21851

A Sharp Matching-Number Threshold for Spectral-Walk Determination of Trees

Chaochao Zhu
View original source ↗Read source document ↗Export metadata ↓

Abstract

The spectral characterization of graphs is a central problem in spectral graph theory. In this paper we study when a tree is determined, among trees, by its generalized spectrum. We use the equivalent formulation given by the adjacency spectrum together with the total-walk sequence $W_k(G)=\mathbf 1^{\mathsf T}A(G)^k\mathbf 1$. We determine the exact matching-number threshold for this tree-level reconstruction problem. If $T$ and $T'$ are trees with matching number at most 4 and have the same adjacency spectrum and the same total-walk sequence, then $T\cong T'$. Moreover, in this range it is enough to require equality of $W_k$ for $3\le k\le8$. The bound is sharp: for every positive integer $m$ we construct a pair of non-isomorphic trees with matching number 5 having the same adjacency spectrum and identical total-walk sequences. The proof of the positive result is based on a finite-core reduction and an algebraic reconstruction of the possible pendant attachments.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chaochao Zhu. 2026-08-22. A Sharp Matching-Number Threshold for Spectral-Walk Determination of Trees. https://arxiv.org/abs/2608.21851

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗