On the Determinant of the Q-walk Matrix of Rooted Product with a Path

被引:0
|
作者
Yan, Zhidan [1 ]
Mao, Lihuan [2 ]
Wang, Wei [1 ]
机构
[1] Anhui Polytech Univ, Sch Math Phys & Finance, Wuhu 241000, Anhui, Peoples R China
[2] Shaanxi Univ Sci & Technol, Sch Math & Data Sci, Xian 710021, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Walk matrix; Rooted product graph; Q-walk matrix; Chebyshev polynomials; GRAPHS;
D O I
10.1007/s40840-024-01774-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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, . . . ,Q(n-1)(G)e], where e is the all-one vector. Let G circle 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, detW(Q)(G circle P-m)=+/-(detQ(G))(m-1)(detW(Q)(G))(m) holds for any m >= 2. This gives a signless Laplacian counterpart of the following recently established identity (Wang et al. in Linear Multilinear Algebra 72:828-840, 2024. https://doi.org/10.1080/03081087.2023.2165612): detW(A)(G circle P-m)=+/-(detA(G))((sic)m/2(sic))(detWA(G))(m), where A(G) is the adjacency matrix of G and W-A(G)=[e,A(G)e, . . . ,A(n-1)(G)e]. We also propose a conjecture to unify the above two equalities.
引用
收藏
页数:17
相关论文
共 21 条
  • [1] Proof of a conjecture on the determinant of the walk matrix of rooted product with a path
    Wang, Wei
    Yan, Zhidan
    Mao, Lihuan
    LINEAR & MULTILINEAR ALGEBRA, 2024, 72 (05): : 828 - 840
  • [2] The k-path vertex cover of rooted product graphs
    Jakovac, Marko
    DISCRETE APPLIED MATHEMATICS, 2015, 187 : 111 - 119
  • [3] COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA
    Kozhevnikov, V. S.
    Matyushkin, I., V
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2019, (46): : 88 - 107
  • [4] ON THE DETERMINANT OF q-DISTANCE MATRIX OF A GRAPH
    Li, Hong-Hai
    Su, Li
    Zhang, Jing
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2014, 34 (01) : 103 - 111
  • [5] Power-product matrix: nonsingularity, sparsity and determinant
    Niu, Yi-Shuai
    Zhang, Hu
    LINEAR & MULTILINEAR ALGEBRA, 2024, 72 (07): : 1170 - 1187
  • [6] Path selection rule in matrix product systems
    Sun, Zhao-Yu
    Yao, Kai-Lun
    Luo, Bo
    Liu, Juan
    Yao, Wei
    Liu, Zu-Li
    PHYSICAL REVIEW B, 2009, 80 (09):
  • [7] Matrix-Product Codes over ?q
    Tim Blackmore
    Graham H. Norton
    Applicable Algebra in Engineering, Communication and Computing, 2001, 12 : 477 - 500
  • [8] Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
    Toh, KC
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1999, 14 (03) : 309 - 330
  • [9] Primal-Dual Path-Following Algorithms for Determinant Maximization Problems With Linear Matrix Inequalities
    Kim-Chuan Toh
    Computational Optimization and Applications, 1999, 14 : 309 - 330
  • [10] Some inequalities for the nonlinear matrix equation Xs + A*X-tA = Q: Trace, determinant and eigenvalue
    Zhou, Duanmei
    Chen, Guoliang
    Zhang, Xiangyun
    APPLIED MATHEMATICS AND COMPUTATION, 2013, 224 : 21 - 28