11 citations · 15 across the 12 of their papers we have counts for
12 papers
An Erdős--Ko--Rado theorem for cross-intersecting families in the Euclidean inner product
Jiang-Chao Wan, Yi Wang
Let be the set of all -element subsets of the set and let be two cross-intersecting families,…
A solution to Csikvári's conjecture and the largest matching root of -graphs
Jiang-Chao Wan, Yi Wang
In 2011, Csikvári [Electron. J. Combin. {\bf 18} (2011), P182] proved that among all graphs with a prescribed number of edges, the largest matching root is attained by a thresh…
Perturbation of the largest matching root of hypergraphs
Jiang-Chao Wan, Yi Wang
The largest matching root of a -graph is the largest real root of its matching polynomial, which is equal to the maximum modulus of all the zeros of the matching polynomial. In…
Subdivision method in the Laplacian matching polynomial
Jiang-Chao Wan, Yi Wang, Zhi-Yuan Wang
As a bridge connecting the matching polynomial and the Laplacian matching polynomial of graphs, the subdivision method is expected to be useful for investigating the Laplacian matc…
A hypergraph Heilmann--Lieb theorem
Jiang-Chao Wan, Yi Wang, Yi-zheng Fan
The Heilmann--Lieb theorem is a fundamental theorem in algebraic combinatorics which provides a characterization of the distribution of the zeros of matching polynomials of graphs.…
Spectra of weighted uniform hypertrees
Jiang-Chao Wan, Yi Wang, Fu-Tao Hu
Let be a -tree equipped with a weighting function $\w: V(T)\cup E(T)\rightarrow \C$, where . The weighted matching polynomial of the weighted -tree $(T,\w)$ is…
The spectral property of hypergraph coverings
Yi-Min Song, Yi-Zheng Fan, Yi Wang +2
Let be a connected -uniform hypergraph, and let be the adjacency tensor of whose spectrum is simply called the spectrum of . Let denote the nu…
On the location of zeros of the Laplacian matching polynomials of graphs
Jiang-Chao Wan, Yi Wang, Ali Mohammadian
The Laplacian matching polynomial of a graph , denoted by , is a new graph polynomial whose all roots are nonnegative real numbers. In this pap…
Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs
Yi-Zheng Fan, Yi Wang, Jiang-Chao Wan
Among all uniform hypergraphs with even uniformity, the odd-transversal or odd-bipartite hypergraphs are more close to bipartite simple graphs from the viewpoint of both structure…
The linear unicyclic hypergraph with the second or third largest spectral radius
Chao Ding, Yi-Zheng Fan, Jiang-Chao Wan
The spectral radius of a uniform hypergraph is defined to be that of the adjacency tensor the hypergraph. It is known that the unique unicyclic hypergraph with the largest spectral…
The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs
Yi-Zheng Fan, Jiang-Chao Wan, Yi Wang
Let be a connected non-odd-bipartite hypergraph with even uniformity. The least H-eigenvalue of the signless Laplacian tensor of is simply called the least eigenvalue of $G…
Eigenvectors of Laplacian or signless Laplacian of Hypergraphs Associated with Zero Eigenvalue
Yi-Zheng Fan, Yi Wang, Yan-Hong Bao +3
Let be a connected -uniform hypergraph. In this paper we mainly consider the eigenvectors of the Laplacian or signless Laplacian tensor of associated with zero eigenvalu…