Jephian C. -H. Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jephian C. -H. Lin has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Leslie Hogben
Department of Mathematics, Iowa State University, Ames, USA
3 shared publications - Aida Abiad
Tilburg University
2 shared publications - Franklin H. J. Kenter
Department of Mathematics, United States Naval Academy, Annapolis, USA
2 shared publications - Ghodratollah Aalipour
Department of Mathematics and Computer Sciences Kharazmi University 50 Taleghani St. Tehran Iran
2 shared publications - Michael E. Young
Department of Psychological Sciences, Kansas State University, Manhattan, USA
2 shared publications - Zhanar Berikkyzy
Department of Mathematics Iowa State University 50011 Ames IA USA
2 shared publications
Latest Publications
- Open Access
Analogies between the crossing number and the tangle crossing number
Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of use in phylogenetics and are represented with straightline drawings where the leaves of the two plane binary trees are on two parallel lines and only the matching edges can cross. The tangle crossing number of a tanglegram is the minimum crossing number over all such drawings and is related to biologically relevant quantities, such as the number of times a parasite switched hosts. Our main results for tanglegrams which parallel known theorems for crossing numbers are as follows. The removal of a single matching edge in a tanglegram with $n$ leaves decreases the tangle crossing number by at most $n-3$, and this is sharp. Additionally, if $\gamma(n)$ is the maximum tangle crossing number of a tanglegram with $n$ leaves, we prove $\frac{1}{2}\binom{n}{2}(1-o(1))\le\gamma(n)<\frac{1}{2}\binom{n}{2}$. Further, we provide an algorithm for computing non-trivial lower bounds on the tangle crossing number in $O(n^4)$ time. This lower bound may be tight, even for tanglegrams with tangle crossing number $\Theta(n^2)$.Open AccessAnalogies between the crossing number and the tangle crossing number
Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of use in phylogenetics and are represented with straightline drawings where the leaves of the two plane binary trees are on two parallel lines and only the matching edges can cross. The tangle crossing number of a tanglegram is the minimum crossing number over all such drawings and is related to biologically relevant quantities, such as the number of times a parasite switched hosts. Our main results for tanglegrams which parallel known theorems for crossing numbers are as follows. The removal of a single matching edge in a tanglegram with $n$ leaves decreases the tangle crossing number by at most $n-3$, and this is sharp. Additionally, if $\gamma(n)$ is the maximum tangle crossing number of a tanglegram with $n$ leaves, we prove $\frac{1}{2}\binom{n}{2}(1-o(1))\le\gamma(n)<\frac{1}{2}\binom{n}{2}$. Further, we provide an algorithm for computing non-trivial lower bounds on the tangle crossing number in $O(n^4)$ time. This lower bound may be tight, even for tanglegrams with tangle crossing number $\Theta(n^2)$. - Open Access
Proof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree
We establish a conjecture of Graham and Lov\'asz that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal; we also prove they are log-concave.
Open AccessProof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree
We establish a conjecture of Graham and Lov\'asz that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal; we also prove they are log-concave.
- Open Access
Note on von Neumann and Rényi entropies of a Graph
We conjecture that all connected graphs of order $n$ have von Neumann entropy at least as great as the star $K_{1,n-1}$ and prove this for almost all graphs of order $n$. We show that connected graphs of order $n$ have R\'enyi 2-entropy at least as great as $K_{1,n-1}$ and for $\alpha>1$, $K_n$ maximizes R\'enyi $\alpha$-entropy over graphs of order $n$. We show that adding an edge to a graph can lower its von Neumann entropy.Open AccessNote on von Neumann and Rényi entropies of a Graph
We conjecture that all connected graphs of order $n$ have von Neumann entropy at least as great as the star $K_{1,n-1}$ and prove this for almost all graphs of order $n$. We show that connected graphs of order $n$ have R\'enyi 2-entropy at least as great as $K_{1,n-1}$ and for $\alpha>1$, $K_n$ maximizes R\'enyi $\alpha$-entropy over graphs of order $n$. We show that adding an edge to a graph can lower its von Neumann entropy. - Open Access
Multi-part Nordhaus-Gaddum type problems for tree-width, Colin de Verdière type parameters, and Hadwiger number
A traditional Nordhaus-Gaddum problem for a graph parameter $\beta$ is to find a (tight) upper or lower bound on the sum or product of $\beta(G)$ and $\beta(\bar{G})$ (where $\bar{G}$ denotes the complement of $G$). An $r$-decomposition $G_1,\dots,G_r$ of the complete graph $K_n$ is a partition of the edges of $K_n$ among $r$ spanning subgraphs $G_1,\dots,G_r$. A traditional Nordhaus-Gaddum problem can be viewed as the special case for $r=2$ of a more general $r$-part sum or product Nordhaus-Gaddum type problem. We determine the values of the $r$-part sum and product upper bounds asymptotically as $n$ goes to infinity for the parameters tree-width and its variants largeur d'arborescence, path-width, and proper path-width. We also establish ranges for the lower bounds for these parameters, and ranges for the upper and lower bounds of the $r$-part Nordhaus-Gaddum type problems for the parameters Hadwiger number, the Colin de Verdi\`ere number $\mu$ that is used to characterize planarity, and its variants $\nu$ and $\xi$.Open AccessMulti-part Nordhaus-Gaddum type problems for tree-width, Colin de Verdière type parameters, and Hadwiger number
A traditional Nordhaus-Gaddum problem for a graph parameter $\beta$ is to find a (tight) upper or lower bound on the sum or product of $\beta(G)$ and $\beta(\bar{G})$ (where $\bar{G}$ denotes the complement of $G$). An $r$-decomposition $G_1,\dots,G_r$ of the complete graph $K_n$ is a partition of the edges of $K_n$ among $r$ spanning subgraphs $G_1,\dots,G_r$. A traditional Nordhaus-Gaddum problem can be viewed as the special case for $r=2$ of a more general $r$-part sum or product Nordhaus-Gaddum type problem. We determine the values of the $r$-part sum and product upper bounds asymptotically as $n$ goes to infinity for the parameters tree-width and its variants largeur d'arborescence, path-width, and proper path-width. We also establish ranges for the lower bounds for these parameters, and ranges for the upper and lower bounds of the $r$-part Nordhaus-Gaddum type problems for the parameters Hadwiger number, the Colin de Verdi\`ere number $\mu$ that is used to characterize planarity, and its variants $\nu$ and $\xi$. - Open Access
Using a new zero forcing process to guarantee the Strong Arnold Property
The maximum nullity $M(G)$ and the Colin de Verdi\`ere type parameter $\xi(G)$ both consider the largest possible nullity over matrices in $\mathcal{S}(G)$, which is the family of real symmetric matrices whose $i,j$-entry, $i\neq j$, is nonzero if $i$ is adjacent to $j$, and zero otherwise; however, $\xi(G)$ restricts to those matrices $A$ in $\mathcal{S}(G)$ with the Strong Arnold Property, which means $X=O$ is the only symmetric matrix that satisfies $A\circ X=O$, $I\circ X=O$, and $AX=O$. This paper introduces zero forcing parameters $Z_{\mathrm{SAP}}(G)$ and $Z_{\mathrm{vc}}(G)$, and proves that $Z_{\mathrm{SAP}}(G)=0$ implies every matrix $A\in \mathcal{S}(G)$ has the Strong Arnold Property and that the inequality $M(G)-Z_{\mathrm{vc}}(G)\leq \xi(G)$ holds for every graph $G$. Finally, the values of $\xi(G)$ are computed for all graphs up to $7$ vertices, establishing $\xi(G)=\lfloor Z\rfloor(G)$ for these graphs.Open AccessUsing a new zero forcing process to guarantee the Strong Arnold Property
The maximum nullity $M(G)$ and the Colin de Verdi\`ere type parameter $\xi(G)$ both consider the largest possible nullity over matrices in $\mathcal{S}(G)$, which is the family of real symmetric matrices whose $i,j$-entry, $i\neq j$, is nonzero if $i$ is adjacent to $j$, and zero otherwise; however, $\xi(G)$ restricts to those matrices $A$ in $\mathcal{S}(G)$ with the Strong Arnold Property, which means $X=O$ is the only symmetric matrix that satisfies $A\circ X=O$, $I\circ X=O$, and $AX=O$. This paper introduces zero forcing parameters $Z_{\mathrm{SAP}}(G)$ and $Z_{\mathrm{vc}}(G)$, and proves that $Z_{\mathrm{SAP}}(G)=0$ implies every matrix $A\in \mathcal{S}(G)$ has the Strong Arnold Property and that the inequality $M(G)-Z_{\mathrm{vc}}(G)\leq \xi(G)$ holds for every graph $G$. Finally, the values of $\xi(G)$ are computed for all graphs up to $7$ vertices, establishing $\xi(G)=\lfloor Z\rfloor(G)$ for these graphs. - Open Access
On the distance spectra of graphs
The distance matrix of a graph $G$ is the matrix containing the pairwise distances between vertices. The distance eigenvalues of $G$ are the eigenvalues of its distance matrix and they form the distance spectrum of $G$. We determine the distance spectra of halved cubes, double odd graphs, and Doob graphs, completing the determination of distance spectra of distance regular graphs having exactly one positive distance eigenvalue. We characterize strongly regular graphs having more positive than negative distance eigenvalues. We give examples of graphs with few distinct distance eigenvalues but lacking regularity properties. We also determine the determinant and inertia of the distance matrices of lollipop and barbell graphs.Open AccessOn the distance spectra of graphs
The distance matrix of a graph $G$ is the matrix containing the pairwise distances between vertices. The distance eigenvalues of $G$ are the eigenvalues of its distance matrix and they form the distance spectrum of $G$. We determine the distance spectra of halved cubes, double odd graphs, and Doob graphs, completing the determination of distance spectra of distance regular graphs having exactly one positive distance eigenvalue. We characterize strongly regular graphs having more positive than negative distance eigenvalues. We give examples of graphs with few distinct distance eigenvalues but lacking regularity properties. We also determine the determinant and inertia of the distance matrices of lollipop and barbell graphs.