Jing Xu

most citedLower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number

3 citations · 3 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2019

The isomorphism problem of trees from the viewpoint of Terwilliger algebras

Shuang-Dong Li, Yi-Zheng Fan, Tatsuro Ito +2

Let $Γ^{(x_{0})}$ be a finite rooted tree, for which $Γ$ is the underlying tree and $x_{0}$ the root. Let $T$ be the Terwilliger algebra of $Γ$ with respect to $x_{0}$ . We study the stru…

math.CO2014★ 3 cited

Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number

Jing Xu, Yi-Zheng Fan, Ying-Ying Tan

In this paper we characterize the unique graph whose algebraic connectivity is minimum among all connected graphs with given order and fixed matching number or edge covering number…