Jephian C.-H. Lin

Orcid: 0000-0003-0119-9376

According to our database1, Jephian C.-H. Lin authored at least 14 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices.
SIAM J. Discret. Math., March, 2024

2021
Strong Chordality of Graphs with Possible Loops.
SIAM J. Discret. Math., 2021

2020
Bipartite Analogues of Comparability and Cocomparability Graphs.
SIAM J. Discret. Math., 2020

The inverse eigenvalue problem of a graph: Multiplicities and minors.
J. Comb. Theory, Ser. B, 2020

Correction to: Properties of a q-Analogue of Zero Forcing.
Graphs Comb., 2020

Properties of a q-Analogue of Zero Forcing.
Graphs Comb., 2020

2019
Strongly chordal digraphs and Γ-free matrices.
CoRR, 2019

Rigid Linkages and Partial Zero Forcing.
Electron. J. Comb., 2019

Critical ideals, minimum rank and zero forcing number.
Appl. Math. Comput., 2019

2018
Graph Families with Constant Distance Determinant.
Electron. J. Comb., 2018

Analogies between the Crossing Number and the Tangle Crossing Number.
Electron. J. Comb., 2018

2017
Zero forcing propagation time on oriented graphs.
Discret. Appl. Math., 2017

On the error of a priori sampling: zero forcing sets and propagation time.
CoRR, 2017

Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph.
Electron. J. Comb., 2017


  Loading...