Jephian C. H. Lin

MINIMUM RANK OF GRAPHS WITH LOOPS

A loop graph

Zero Forcing Propagation Time on Oriented Graphs

\mf G

Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups

is a finite undirected graph that allows loops but does not allow multiple edges. The set

Note on von Neumann and Rényi entropies of a graph

\sym(\lG)

On the Distance Spectra of Graphs

of real symmetric matrices associated with a loop graph

Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph

\lG

Rainbow arithmetic progressions

of order

Critical ideals, minimum rank and zero forcing number

n

Zero forcing number, Grundy domination number, and their variants

is the set of symmetric matrices

Using a new zero forcing process to guarantee the Strong Arnold Property

A=[a_{ij}]\in\Rnn