On the walk matrix of the Dynkin graph D_n

From MaRDI portal
Publication:2676743




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].









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)