\(A_α\)-Wronskian Vertices of Paths and Controllability of Path-Rooted Products

For a graph \(G\) with adjacency and degree matrices \(A(G)\) and \(D(G)\), set \(A_α(G)=αD(G)+(1-α)A(G)\) for \(0\leqα<1\). Using Chebyshev polynomials and a theorem of Conway and Jones, we classify the \(A_α\)-Wronskian vertices of every path \(P_n\), \(n\geq2\) (equivalently, the standard basis vectors cyclic for \(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 \(0\) and \(1/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_α\)-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\leqα<1\), algebraic conjugates further simplify the spectral test for general rooted products.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.21385
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

\(A_α\)-Wronskian Vertices of Paths and Controllability of Path-Rooted Products

Haiying Shan, Xiaoqi Liu
arXiv (Cornell University)
Graph theory and applications
preprint

\(A_α\)-Wronskian Vertices of Paths and Controllability of Path-Rooted Products

Haiying Shan, Xiaoqi Liu
preprint en

Abstract

For a graph \(G\) with adjacency and degree matrices \(A(G)\) and \(D(G)\), set \(A_α(G)=αD(G)+(1-α)A(G)\) for \(0\leqα<1\). Using Chebyshev polynomials and a theorem of Conway and Jones, we classify the \(A_α\)-Wronskian vertices of every path \(P_n\), \(n\geq2\) (equivalently, the standard basis vectors cyclic for \(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 \(0\) and \(1/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_α\)-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\leqα<1\), algebraic conjugates further simplify the spectral test for general rooted products.

arXiv (Cornell University)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon