68 citations · 503 across the 48 of their papers we have counts for
49 papers
Spectral extremal graphs for edge blow-up of star forests
Jing Wang, Zhenyu Ni, Liying Kang +1
The edge blow-up of a graph , denoted by , is obtained by replacing each edge of with a clique of order , where the new vertices of the cliques are all distinc…
The trace of uniform hypergraphs with application to Estrada index
Yi-Zheng Fan, Jian Zheng, Ya Yang
In this paper we investigate the traces of the adjacency tensor of hypergraphs (simply called the traces of hypergraphs). We give new expressions for the traces of hypertrees and l…
High-ordered spectral characterization of unicyclic graphs
Yi-Zheng Fan, Hong-Xia Yang, Jian Zheng
In this paper we will apply the tensor and its traces to investigate the spectral characterization of unicyclic graphs. Let be a graph and be the -th power (hypergraph…
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.…
The trace and Estrada index of uniform hypergraphs with cut vertices
Yi-Zheng Fan, Ya Yang, Chuan-Ming She +3
Let be an -uniform hypergraph, and let be the adjacency tensor of which can be viewed as a system of homogeneous polynomia…
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…