The following pages link to Jephian C.-H. Lin (Q254890):
Displayed 35 items.
- On the distance spectra of graphs (Q254892) (← links)
- Using a new zero forcing process to guarantee the strong Arnold property (Q306447) (← links)
- Analogies between the crossing number and the tangle crossing number (Q1627199) (← links)
- Graph families with constant distance determinant (Q1630898) (← links)
- Zero forcing number, Grundy domination number, and their variants (Q1713312) (← links)
- Sign patterns requiring a unique inertia (Q1743132) (← links)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
- Rigid linkages and partial zero forcing (Q2001975) (← links)
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time (Q2002553) (← links)
- The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph (Q2144236) (← links)
- The strong spectral property for graphs (Q2173323) (← links)
- Complex Hadamard diagonalisable graphs (Q2197273) (← links)
- Properties of a \(q\)-analogue of zero forcing (Q2227980) (← links)
- Correction to: ``Properties of a \(q\)-analogue of zero forcing'' (Q2227981) (← links)
- On the inverse eigenvalue problem for block graphs (Q2238880) (← links)
- Critical ideals, minimum rank and zero forcing number (Q2279368) (← links)
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph (Q2363102) (← links)
- Counterexamples to an edge spread question for zero forcing number (Q2442364) (← links)
- Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups (Q2794394) (← links)
- Proof of a conjecture of Graham and Lov\'asz concerning unimodality of coefficients of the distance characteristic polynomial of a tree (Q4685888) (← links)
- Inverse Problems and Zero Forcing for Graphs (Q5039750) (← links)
- Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
- The sepr-sets of sign patterns (Q5132625) (← links)
- (Q5133654) (← links)
- The Inverse Eigenvalue Problem of a Graph, Zero Forcing, and Related Parameters (Q5149395) (← links)
- (Q5251985) (← links)
- (Q5501716) (← links)
- Strong Chordality of Graphs with Possible Loops (Q5854465) (← links)
- The liberation set in the inverse eigenvalue problem of a graph (Q6168543) (← links)
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices (Q6202755) (← links)
- Multi-part Nordhaus-Gaddum type problems for tree-width, Colin de Verdi\`ere type parameters, and Hadwiger number (Q6273021) (← links)
- On the distance matrices of the CP graphs (Q6302124) (← links)
- Strongly chordal digraphs and $\Gamma$-free matrices (Q6324899) (← links)
- Complementary Vanishing Graphs (Q6405051) (← links)
- The inverse nullity pair problem and the strong nullity interlacing property (Q6456081) (← links)