YFYi-Zheng Fan
Yi-Zheng Fan
*This is an algorithmically generated author record based on publicly available information.
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
Research Interests
Yi-Zheng Fan has a total of 125 co-authors. Here are the top co-authors by number of shared publications:
- Yi Wang
Center for Pure Mathematics, School of Mathematical Sciences, Anhui University, Hefei, People’s Republic of China
21 shared publications Yi Wang
14 shared publicationsDong Liang
Key Lab Intelligent Computing & Signal Ministry of Education, Anhui University, Hefei, 230039, China
10 shared publications- Long Wang
School of Mathematics and Big Data, Anhui University of Science and Technology, Huainan, China
7 shared publications Nian Wang
Key Lab Intelligent Computing & Signal Ministry of Education, Anhui University, Hefei, 230039, China
7 shared publications- Yan-Hong Bao
Anhui University
7 shared publications
Latest Publications
- 28 October 2026
- Published by Springer Nature in Annals of Combinatorics
- p. 1-17
Largest Laplacian Eigenvalues of Simplicial Complexes: Local Bounds and Equality Criteria via Homology
- 28 October 2026
- Published by Springer Nature in Annals of Combinatorics
- p. 1-17
Largest Laplacian Eigenvalues of Simplicial Complexes: Local Bounds and Equality Criteria via Homology
- Open Access
Spectral radius of $2$-dimensional simplicial complexes with given Betti number
In this paper we establish an asymptotic formula for the signless Laplacian spectral radius of a $2$-dimensional simplicial complex with given $2$-th Betti number. Furthermore, we characterize the $2$-dimensional simplicial complex that achieves the maximum signless Laplacian spectral radius among all-dimensional simplicial complex with the $2$-th Betti number equal to $1$ or $2$.Open AccessSpectral radius of $2$-dimensional simplicial complexes with given Betti number
In this paper we establish an asymptotic formula for the signless Laplacian spectral radius of a $2$-dimensional simplicial complex with given $2$-th Betti number. Furthermore, we characterize the $2$-dimensional simplicial complex that achieves the maximum signless Laplacian spectral radius among all-dimensional simplicial complex with the $2$-th Betti number equal to $1$ or $2$. - Open Access
Degree-similar graphs and cospectral graphs
Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_μ(G):=A(G)-μD(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exists an invertible matrix $M$ such that $M^{-1} A(G_1) M =A(G_2)$ and $M^{-1} D(G_1) M =D(G_2)$. In this paper, we address three problems concerning degree-similar graphs proposed by Godsil and Sun. First, we present a new characterization of degree-similar graphs using degree partition, from which we derive methods and examples for constructing cospectral graphs and degree-similar graphs. Second, we construct infinite pairs of non-degree-similar trees $G_1$ and $G_2$ such that $tI- L_μ(G_1)$ and $tI-L_μ(G_2)$ have the same Smith normal form over $\Q(μ)[t]$, which provides a negative answer to a problem posed by Godsil and Sun. Third, we establish several invariants of degree-similar graphs and obtain results on unicyclic graphs that are degree-similar determined. Lastly we prove that for a strongly regular graph $G$ and any two edges $e$ and $f$ of $G$, $G \backslash e$ and $G \backslash f$ have identical $μ$-polynomial, i.e., $\det(tI-L_μ(G \backslash e))=\det(tI-L_μ(G \backslash f))$, which enables the construction of pairs of non-isomorphic graphs with same $μ$-polynomial, where $G \backslash e$ denotes the graph obtained from $G$ by deleting the edge $e$.Open AccessDegree-similar graphs and cospectral graphs
Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_μ(G):=A(G)-μD(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exists an invertible matrix $M$ such that $M^{-1} A(G_1) M =A(G_2)$ and $M^{-1} D(G_1) M =D(G_2)$. In this paper, we address three problems concerning degree-similar graphs proposed by Godsil and Sun. First, we present a new characterization of degree-similar graphs using degree partition, from which we derive methods and examples for constructing cospectral graphs and degree-similar graphs. Second, we construct infinite pairs of non-degree-similar trees $G_1$ and $G_2$ such that $tI- L_μ(G_1)$ and $tI-L_μ(G_2)$ have the same Smith normal form over $\Q(μ)[t]$, which provides a negative answer to a problem posed by Godsil and Sun. Third, we establish several invariants of degree-similar graphs and obtain results on unicyclic graphs that are degree-similar determined. Lastly we prove that for a strongly regular graph $G$ and any two edges $e$ and $f$ of $G$, $G \backslash e$ and $G \backslash f$ have identical $μ$-polynomial, i.e., $\det(tI-L_μ(G \backslash e))=\det(tI-L_μ(G \backslash f))$, which enables the construction of pairs of non-isomorphic graphs with same $μ$-polynomial, where $G \backslash e$ denotes the graph obtained from $G$ by deleting the edge $e$. - 26 June 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 61 (4) , 1-21
The largest Laplacian eigenvalue and the balancedness of simplicial complexes
- 26 June 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 61 (4) , 1-21
The largest Laplacian eigenvalue and the balancedness of simplicial complexes
- 21 April 2025
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 51 (3) , 1-15
The Normalized Laplacian Eigenvalue and Incidence Balancedness of Simplicial Complexes
- 21 April 2025
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 51 (3) , 1-15
The Normalized Laplacian Eigenvalue and Incidence Balancedness of Simplicial Complexes
- 13 February 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (6)
Spectral bipartite Turán problems on linear hypergraphs
- 13 February 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (6)
Spectral bipartite Turán problems on linear hypergraphs
- Open Access
Hypergraph coverings and Ramanujan Hypergraphs
In this paper we investigate Ramanujan hypergraphs by using hypergraph coverings. We first show that the spectrum of a $k$-fold covering $\bar{H}$ of a connected hypergraph $H$ contains the spectrum of $H$, and that it is the union of the spectrum of $H$ and the spectrum of an incidence-signed hypergraph with $H$ as underlying hypergraph if $k=2$, which generalizes Bilu-Linial result on graph coverings. We give a lower bound for the second largest eigenvalue of a $d$-regular hypergraph by universal cover, which generalizes Alon-Boppana bound on $d$-regular graphs and Feng-Li bound on $(d,r)$-regular hypergraphs. By using interlacing family of polynomials, we prove that every $(d,r)$-regular hypergraph has a right-sided Ramanujan $2$-covering, and has a left-sided Ramanujan $2$-covering if the roots of the matching polynomial of its incident graph satisfy some condition. By Ramanujan $2$-coverings, we prove the existence of some families of infinite many left-sided or right-sided $(d,r)$-regular Ramanujan hypergraphs under certain conditions on $d$ and $r$.Open AccessHypergraph coverings and Ramanujan Hypergraphs
In this paper we investigate Ramanujan hypergraphs by using hypergraph coverings. We first show that the spectrum of a $k$-fold covering $\bar{H}$ of a connected hypergraph $H$ contains the spectrum of $H$, and that it is the union of the spectrum of $H$ and the spectrum of an incidence-signed hypergraph with $H$ as underlying hypergraph if $k=2$, which generalizes Bilu-Linial result on graph coverings. We give a lower bound for the second largest eigenvalue of a $d$-regular hypergraph by universal cover, which generalizes Alon-Boppana bound on $d$-regular graphs and Feng-Li bound on $(d,r)$-regular hypergraphs. By using interlacing family of polynomials, we prove that every $(d,r)$-regular hypergraph has a right-sided Ramanujan $2$-covering, and has a left-sided Ramanujan $2$-covering if the roots of the matching polynomial of its incident graph satisfy some condition. By Ramanujan $2$-coverings, we prove the existence of some families of infinite many left-sided or right-sided $(d,r)$-regular Ramanujan hypergraphs under certain conditions on $d$ and $r$. - 1 January 2024
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 44 (3) , 1107-1141
High-ordered spectral characterization of unicyclic graphs
- 1 January 2024
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 44 (3) , 1107-1141
High-ordered spectral characterization of unicyclic graphs
- 8 December 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (3)
The spectral property of hypergraph coverings
- 8 December 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (3)
The spectral property of hypergraph coverings
- Open Access
The spectral property of hypergraph coverings
Let $H$ be a connected $m$-uniform hypergraph, and let $\mathcal{A}(H)$ be the adjacency tensor of $H$ whose spectrum is simply called the spectrum of $H$. Let $s(H)$ denote the number of eigenvectors of $\mathcal{A}(H)$ associated with the spectral radius, and $c(H)$ denote the number of eigenvalues of $\mathcal{A}(H)$ with modulus equal to the spectral radius, which are respectively called the stabilizing index and cyclic index of $H$. Let $\bar{H}$ be a $k$-fold covering of $H$ which can be obtained from some permutation assignment in the symmetric group $\mathbf{S}_k$ on $H$. In this paper, we first characterize the connectedness of $\bar{H}$ by its incidence graph and the permutation assignment, and then investigate the relationship between the spectral property of $H$ and that of $\bar{H}$. By applying module theory and group representation, if $\bar{H}$ is connected, we prove that $s(H) \mid s(\bar{H})$ and $c(H) \mid c(\bar{H})$. In particular, when $\bar{H}$ is a $2$-fold covering of $H$, if $m$ is even, we show that regardless of multiplicities, the spectrum of $\bar{H}$ contains the spectrum of $H$ and the spectrum of a signed hypergraph with $H$ as underlying hypergraph; if $m$ is odd, we give an explicit formula for $s(\bar{H})$. We also find some differences on the spectral property between hypergraph coverings and graph coverings by examples.Open AccessThe spectral property of hypergraph coverings
Let $H$ be a connected $m$-uniform hypergraph, and let $\mathcal{A}(H)$ be the adjacency tensor of $H$ whose spectrum is simply called the spectrum of $H$. Let $s(H)$ denote the number of eigenvectors of $\mathcal{A}(H)$ associated with the spectral radius, and $c(H)$ denote the number of eigenvalues of $\mathcal{A}(H)$ with modulus equal to the spectral radius, which are respectively called the stabilizing index and cyclic index of $H$. Let $\bar{H}$ be a $k$-fold covering of $H$ which can be obtained from some permutation assignment in the symmetric group $\mathbf{S}_k$ on $H$. In this paper, we first characterize the connectedness of $\bar{H}$ by its incidence graph and the permutation assignment, and then investigate the relationship between the spectral property of $H$ and that of $\bar{H}$. By applying module theory and group representation, if $\bar{H}$ is connected, we prove that $s(H) \mid s(\bar{H})$ and $c(H) \mid c(\bar{H})$. In particular, when $\bar{H}$ is a $2$-fold covering of $H$, if $m$ is even, we show that regardless of multiplicities, the spectrum of $\bar{H}$ contains the spectrum of $H$ and the spectrum of a signed hypergraph with $H$ as underlying hypergraph; if $m$ is odd, we give an explicit formula for $s(\bar{H})$. We also find some differences on the spectral property between hypergraph coverings and graph coverings by examples.