A general formula for walk determinants of rooted products with applications to DGS-graph constructions
Combinatorics
2026-01-06 v1
Abstract
For an -vertex graph , and a rooted graph with as the root, the rooted product graph is obtained from and copies of by identifying the root of the th copy of with the th vertex of for each . As a refinement of the controllability criterion of obtained recently by Shan and Liu (2025), we obtain an explicit formula for the determinant of the walk matrix of . Furthermore, for an important family of graphs that are determined by their generalized spectrum (DGS), we introduce the concept of -preservers and provide a sufficient condition for a rooted graph to be an -preserver. A list of -preservers of small order is provided, which leads to many new infinite families of DGS-graphs using rooted products.
Cite
@article{arxiv.2601.01542,
title = {A general formula for walk determinants of rooted products with applications to DGS-graph constructions},
author = {Wei Wang and Jie Shen and Lihuan Mao},
journal= {arXiv preprint arXiv:2601.01542},
year = {2026}
}