Jephian C.-H. Lin

activity

20212023

collaborators

4 papers

math.CO2023

The inverse nullity pair problem and the strong nullity interlacing property

Aida Abiad, Bryan A. Curtis, Mary Flagg +3

The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph $G$ . In…

math.CO2023

The liberation set in the inverse eigenvalue problem of a graph

Jephian C. -H. Lin, Polona Oblak, Helena Šmigoc

The inverse eigenvalue problem of a graph $G$ is the problem of characterizing all lists of eigenvalues of real symmetric matrices whose off-diagonal pattern is prescribed by the a…

math.CO2022

Complementary Vanishing Graphs

Craig Erickson, Luyining Gan, Jürgen Kritschgau +2

Given a graph $G$ with vertices ${v_{1}, \dots, v_{n}}$ , we define $S (G)$ to be the set of symmetric matrices $A = [a_{i, j}]$ such that for $i \neq = j$ we have $a_{i, j} \neq = 0$ if…

math.CO2021

The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph

Shaun M. Fallat, H. Tracy Hall, Jephian C. -H. Lin +1

The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property…