Yi Wang
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
Yi Wang has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Yi-Zheng Fan
Center for Pure Mathematics, School of Mathematical Sciences, Anhui University, Hefei, People’s Republic of China
21 shared publications - Jiang-Chao Wan
School of Mathematical Sciences, Anhui University, Hefei, People’s Republic of China
8 shared publications - Bo-Jun Yuan
School of Science Zhejiang University of Science and Technology 310023 Hangzhou P. R. China
5 shared publications - Long Wang
School of Mathematics and Big Data, Anhui University of Science and Technology, Huainan, China
3 shared publications - Ali Mohammadian
School of Mathematical Sciences, Anhui University, Hefei, China
2 shared publications Jiang-Chao Wan
2 shared publications
Latest Publications
- 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
- 8 May 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 61 (3) , 1-14
Subdivision method in the Laplacian matching polynomial
- 8 May 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 61 (3) , 1-14
Subdivision method in the Laplacian matching polynomial
- Open Access
Maximum spread of $K_r$-minor free graphs
The spread of a graph is the difference between the largest and smallest eigenvalue of its adjacency matrix. In this paper, we investigate spread problems for graphs with excluded clique-minors. We show that for sufficiently large $n$, the $n$-vertex $K_r$-minor free graph with maximum spread is the join of a clique and an independent set, with $r-2$ and $n-r+2$ vertices, respectively.Open AccessMaximum spread of $K_r$-minor free graphs
The spread of a graph is the difference between the largest and smallest eigenvalue of its adjacency matrix. In this paper, we investigate spread problems for graphs with excluded clique-minors. We show that for sufficiently large $n$, the $n$-vertex $K_r$-minor free graph with maximum spread is the join of a clique and an independent set, with $r-2$ and $n-r+2$ vertices, respectively. - Open Access
Subdivision method in the Laplacian matching polynomial
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 matching polynomial. In this paper, we study applications of the method from three aspects. We prove that the zero sequence of the Laplacian matching polynomial of a graph majorizes its degree sequence, establishing a dual relation between the Laplacian matching polynomial and the characteristic polynomial of the signless Laplacian matrix of graphs. In addition, from different viewpoints, we give a new combinatorial interpretations for the coefficients of the Laplacian matching polynomial.
Open AccessSubdivision method in the Laplacian matching polynomial
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 matching polynomial. In this paper, we study applications of the method from three aspects. We prove that the zero sequence of the Laplacian matching polynomial of a graph majorizes its degree sequence, establishing a dual relation between the Laplacian matching polynomial and the characteristic polynomial of the signless Laplacian matrix of graphs. In addition, from different viewpoints, we give a new combinatorial interpretations for the coefficients of the Laplacian matching polynomial.
- 3 January 2024
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 40 (1) , 129-136
On the Difference Between the Skew-rank of an Oriented Graph and the Rank of Its Underlying Graph
- 3 January 2024
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 40 (1) , 129-136
On the Difference Between the Skew-rank of an Oriented Graph and the Rank of Its Underlying Graph
- 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. - Open Access
Distribution of zeros of matching polynomials of hypergraphs
Let $\h$ be a connected $k$-graph with maximum degree ${\Delta}\geq 2$ and let $\mu(\h, x)$ be the matching polynomial of $\h$. In this paper, we focus on studying the distribution of zeros of the matching polynomials of $k$-graphs. We prove that the zeros (with multiplicities) of $\mu(\h, x)$ are invariant under a rotation of an angle $2\pi/{\ell}$ in the complex plane for some positive integer $\ell$ and $k$ is the maximum integer with this property. Let $\lambda(\h)$ denote the maximum modulus of all zeros of $\mu(\h, x)$. We show that $\lambda(\h)$ is a simple root of $\mu(\h, x)$ and $$\Delta^{1\over k} \leq \lambda(\h)< \frac{k}{k-1}\big((k-1)(\Delta-1)\big)^{1\over k}.$$ To achieve these, we introduce the path tree $\T(\h,u)$ of $\h$ with respect to a vertex $u$ of $\h$, which is a $k$-tree, and prove that $$\frac{\mu(\h-u,x)}{\mu(\h, x)} = \frac{\mu(\T(\h,u)-u,x) }{\mu(\T(\h,u),x)},$$ which generalizes the celebrated Godsil's identity on the matching polynomial of graphs.Open AccessDistribution of zeros of matching polynomials of hypergraphs
Let $\h$ be a connected $k$-graph with maximum degree ${\Delta}\geq 2$ and let $\mu(\h, x)$ be the matching polynomial of $\h$. In this paper, we focus on studying the distribution of zeros of the matching polynomials of $k$-graphs. We prove that the zeros (with multiplicities) of $\mu(\h, x)$ are invariant under a rotation of an angle $2\pi/{\ell}$ in the complex plane for some positive integer $\ell$ and $k$ is the maximum integer with this property. Let $\lambda(\h)$ denote the maximum modulus of all zeros of $\mu(\h, x)$. We show that $\lambda(\h)$ is a simple root of $\mu(\h, x)$ and $$\Delta^{1\over k} \leq \lambda(\h)< \frac{k}{k-1}\big((k-1)(\Delta-1)\big)^{1\over k}.$$ To achieve these, we introduce the path tree $\T(\h,u)$ of $\h$ with respect to a vertex $u$ of $\h$, which is a $k$-tree, and prove that $$\frac{\mu(\h-u,x)}{\mu(\h, x)} = \frac{\mu(\T(\h,u)-u,x) }{\mu(\T(\h,u),x)},$$ which generalizes the celebrated Godsil's identity on the matching polynomial of graphs. - 11 April 2022
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 56 (3) , 755-771
On the location of zeros of the Laplacian matching polynomials of graphs
- 11 April 2022
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 56 (3) , 755-771
On the location of zeros of the Laplacian matching polynomials of graphs
- 1 October 2021
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 627, 150-161
On the largest eigenvalue of a mixed graph with partial orientation
- 1 October 2021
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 627, 150-161
On the largest eigenvalue of a mixed graph with partial orientation