Search arXivSearch

arXiv · 2601.01542

A general formula for walk determinants of rooted products with applications to DGS-graph constructions

Abstract

For an $n$-vertex graph $G$, and a rooted graph $H^{(v)}$ with $v$ as the root, the rooted product graph $G\circ H^{(v)}$ is obtained from $G$ and $n$ copies of $H$ by identifying the root of the $i$th copy of $H$ with the $i$th vertex of $G$ for each $i$. As a refinement of the controllability criterion of $G\circ H^{(v)}$ obtained recently by Shan and Liu (2025), we obtain an explicit formula for the determinant of the walk matrix of $G\circ H^{(v)}$. Furthermore, for an important family of graphs $\mathcal{F}$ that are determined by their generalized spectrum (DGS), we introduce the concept of $\mathcal{F}$-preservers and provide a sufficient condition for a rooted graph to be an $\mathcal{F}$-preserver. A list of $\mathcal{F}$-preservers of small order is provided, which leads to many new infinite families of DGS-graphs using rooted products.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wei Wang, Jie Shen, Lihuan Mao. 2026-01-04. A general formula for walk determinants of rooted products with applications to DGS-graph constructions. https://arxiv.org/abs/2601.01542

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

KEEP EXPLORING

Related papers

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

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