On the determinant of the Q-walk matrix of rooted product with a path
Abstract
Let G be an n-vertex graph and Q(G) be its signless Laplacian matrix. The Q-walk matrix of G, denoted by WQ(G), is [e,Q(G)e,…,Qn-1(G)e], where e is the all-one vector. Let G Pm be the graph obtained from G and n copies of the path Pm by identifying the i-th vertex of G with an endvertex of the i-th copy of Pm for each i. We prove that, WQ(G Pm)= ( Q(G))m-1( WQ(G))m holds for any m 2. This gives a signless Laplacian counterpart of the following recently established identity [17]: WA(G Pm)= ( A(G))m2( WA(G))m, where A(G) is the adjacency matrix of G and WA(G)=[e,A(G)e,…,An-1(G)e]. We also propose a conjecture to unify the above two equalities.
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.