Proof of a conjecture on the determinant of walk matrix of rooted product with a path

Abstract

The walk matrix of an n-vertex graph G with adjacency matrix A, denoted by W(G), is [e,Ae,…,An-1e], where e is the all-ones vector. Let G Pm be the rooted product of G and a rooted path Pm (taking an endvertex as the root), i.e., G Pm is a graph obtained from G and n copies of Pm by identifying each vertex of G with an endvertex of a copy of Pm. Mao-Liu-Wang (2015) and Mao-Wang (2022) proved that, for m=2 and m∈\3,4\, respectively W(G Pm)= a0m2( W(G))m, where a0 is the constant term of the characteristic polynomial of G. Furthermore, Mao-Wang (2022) conjectured that the formula holds for any m 2. In this note, we verify this conjecture using the technique of Chebyshev polynomials.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…