On the walk matrix of the Dynkin graph D_n

From MaRDI portal
Publication:2676743

DOI10.1016/J.LAA.2022.08.015zbMATH Open1497.05165arXiv2202.13279OpenAlexW4292241515WikidataQ114151223 ScholiaQ114151223MaRDI QIDQ2676743FDOQ2676743


Authors: Wei Wang, Chuanming Wang, Songlin Guo Edit this on Wikidata


Publication date: 28 September 2022

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Let W(Dn) denote the walk matrix of the Dynkin graph Dn, a tree obtained from the path of order n1 by adding a pendant edge at the second vertex. We prove that extrank,W(Dn)=n2 if 4midn and extrank,W(Dn)=n1 otherwise. Furthermore, we prove that the Smith normal form of W(Dn) is ext{diag}[underbrace{1,1,ldots,1}_{lceilfrac{n}{2} ceil},underbrace{2,2,ldots,2}_{lfloorfrac{n}{2} floor-1},0] when 4midn. This confirms a recent conjecture in [W.Wang, F.Liu, W.Wang, Generalized spectral characterizations of almost controllable graphs, European J. Combin., 96(2021):103348].


Full work available at URL: https://arxiv.org/abs/2202.13279




Recommendations




Cites Work


Cited In (7)





This page was built for publication: On the walk matrix of the Dynkin graph \(D_n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676743)