On the determinant of the walk matrix of the rooted product with a path

Abstract

For an n-vertex graph G, the walk matrix of G, denoted by W(G), is the matrix [e,A(G)e,…,(A(G))n-1e], where A(G) is the adjacency matrix of G and e is the all-ones vector. For two integers m and with 1 (m+1)/2, let G Pm() be the rooted product of G and the path Pm taking the -th vertex of Pm as the root, i.e., G Pm() is a graph obtained from G and n copies of the path Pm by identifying the i-th vertex of G with the -th vertex (the root vertex) of the i-th copy of Pm for each i. We prove that, W(G Pm()) equals ( A(G))m2( W(G))m if (,m+1)=1, and equals 0 otherwise. This extends a recent result established in [Wang et al. Linear Multilinear Algebra 72 (2024): 828--840] which corresponds to the special case =1. As a direct application, we prove that if G satisfies A(G)= 1 and W(G)= 2 n/2, then for any sequence of integer pairs (mi,i) with (i,mi+1)=1 for each i, all the graphs in the family equation* G Pm1(1), (G Pm1(1)) Pm2(2), ((G Pm1(1)) Pm2(2)) Pm3(3),… equation* are determined by their generalized spectrum.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…