betaFeedback

WorksMathematics

AαA_α-Wronskian Vertices of Paths and Controllability of Path-Rooted Products

Abstract

For a graph GG with adjacency and degree matrices A(G)A(G) and D(G)D(G), set Aα(G)=αD(G)+(1−α)A(G)A_α(G)=αD(G)+(1-α)A(G) for 0≤α<10\leqα<1. Using Chebyshev polynomials and a theorem of Conway and Jones, we classify the AαA_α-Wronskian vertices of every path PnP_n, n≥2n\geq2 (equivalently, the standard basis vectors cyclic for Aα(Pn)A_α(P_n)). The central vertex of an odd-order path is never Wronskian; for every other vertex, we determine an explicit finite set of algebraic exceptional parameters. These sets contain no rational parameters other than 00 and 1/21/2, for which the adjacency and signless Laplacian cases are characterized by gcd criteria. For even-order paths rooted at either central vertex, we explicitly evaluate the root resultant and the walk-determinant polynomial in the rooted-product factorization. The resulting controllability criterion combines AαA_α-controllability of the base graph with at most three explicit spectral exclusions. For each parameter, one of two fixed complementary base graphs yields controllable products for every even-order path and both central roots. For 1/2≤α<11/2\leqα<1, algebraic conjugates further simplify the spectral test for general rooted products.

Paper details

vlnc:W_45vy46kz
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Codex

View statement
Looking for related papers…