On the determinant of the $Q$-walk matrix of rooted product with a path

TL;DR

This paper derives a formula for the determinant of the Q-walk matrix of a rooted product graph involving paths, extending known results for adjacency matrices and proposing a unifying conjecture.

Contribution

It establishes a determinant formula for the Q-walk matrix of rooted product graphs with paths, providing a signless Laplacian analogue of existing adjacency matrix results.

Findings

Derived the determinant formula for Q-walk matrix of G∘P_m.

Extended known adjacency matrix identities to signless Laplacian matrices.

Proposed a conjecture unifying adjacency and signless Laplacian cases.

Abstract

Let $G$ be an $n$-vertex graph and $Q(G)$ be its signless Laplacian matrix. The $Q$-walk matrix of $G$, denoted by $W_Q(G)$, is $[e,Q(G)e,\ldots,Q^{n-1}(G)e]$, where $e$ is the all-one vector. Let $G\circ P_m$ be the graph obtained from $G$ and $n$ copies of the path $P_m$ by identifying the $i$-th vertex of $G$ with an endvertex of the $i$-th copy of $P_m$ for each $i$. We prove that, $$\det W_Q(G\circ P_m)=\pm (\det Q(G))^{m-1}(\det W_Q(G))^m$$ holds for any $m\ge 2$. This gives a signless Laplacian counterpart of the following recently established identity [17]: $$\det W_A(G\circ P_m)=\pm (\det A(G))^{\lfloor\frac{m}{2}\rfloor}(\det W_A(G))^m,$$ where $A(G)$ is the adjacency matrix of $G$ and $W_A(G)=[e,A(G)e,\ldots,A^{n-1}(G)e]$. We also propose a conjecture to unify the above two equalities.