Yi Wang

activity

20122026

most citedEigenvectors of Laplacian or signless Laplacian of Hypergraphs Associated with Zero Eigenvalue

11 citations · 38 across the 16 of their papers we have counts for

collaborators

18 papers

math.CO2026

Helmholzian Spectra of Graphs: Novel Properties

Lu Lu, Yongtang Shi, Zoran Stanić +2

Let $\grad$, $\curl$, and $\dv$ be the graph-theoretic analogues of the gradient, curl, and divergence operators from multivariate calculus. The graph Laplacian $-\dv \grad$ gives…

math.CO2024

On the Spread of Graph-Related Matrices

Lele Liu, Yi-Zheng Fan, Yi Wang +1

The spread of a real symmetric matrix is defined as the difference between its largest and smallest eigenvalue. The study of graph-related matrices has attracted considerable atten…

math.CO2024

Spectral Methods for Matrix Product Factorization

Saieed Akbari, Yi-Zheng Fan, Fu-Tao Hu +2

A graph $G$ is factored into graphs $H$ and $K$ via a matrix product if there exist adjacency matrices $A$ , $B$ , and $C$ of $G$ , $H$ , and $K$ , respectively, such that $A = B C$ . In…

math.CO2024★ 3 cited

The largest Laplacian eigenvalue and the balancedness of simplicial complexes

Yi-Zheng Fan, Hui-Feng Wu, Yi Wang

Let $K$ be a simplical complex, and let $L_{i}^{u p} (K), Q_{i}^{u p} (K)$ be the $i$ -th up Laplacian and signless Laplacian of $K$ , respectively. In this paper we prov…

math.CO2023

The spectra of Laplace operators on covering simplicial complexes

Yi-Zheng Fan, Yi-Min Song, Yi Wang

We give a decomposition of the Laplace operator (in matrix form) of a covering simplicial complex as a direct sum of several matrices, one of which is the Laplace operator of the b…

math.CO2021★ 2 cited

The spectral property of hypergraph coverings

Yi-Min Song, Yi-Zheng Fan, Yi Wang +2

Let $H$ be a connected $m$ -uniform hypergraph, and let $A (H)$ be the adjacency tensor of $H$ whose spectrum is simply called the spectrum of $H$ . Let $s (H)$ denote the nu…

math.CO2020★ 2 cited

A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs

Yi Wang, Le Wang, Yi-Zheng Fan

An oriented hypergraph is a hypergraph together with an incidence orientation such that each edge-vertex incidence is given a label of $+ 1$ or $- 1$ . An oriented hypergraph is calle…

math.CO2020

On the largest eigenvalue of a mixed graph with partial orientation

Bo-Jun Yuan, Yi Wang, Yi-Zheng Fan

Let $G$ be a connected graph and let $T$ be a spanning tree of $G$ . A partial orientation $σ$ of $G$ respect to $T$ is an orientation of the edges of $G$ except those edges of $T$ ,…

math.CO2020

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…

math.CO2020★ 1 cited

The least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices

Yi-Zheng Fan, Zhu Zhu, Yi Wang

Let $G$ be a connected hypergraph with even uniformity, which contains cut vertices. Then $G$ is the coalescence of two nontrivial connected sub-hypergraphs (called branches) at a…

math.CO2019

On mixed graphs whose Hermitian spectral radii are at most 2

Bo-Jun Yuan, Yi Wang, Shi-Cai Gong +1

A mixed graph is a graph with undirected and directed edges. Guo and Mohar in 2017 determined all mixed graphs whose Hermitian spectral radii are less than $2$ . In this paper, we g…

math.CO2019★ 1 cited

The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs

Yi-Zheng Fan, Jiang-Chao Wan, Yi Wang

Let $G$ be a connected non-odd-bipartite hypergraph with even uniformity. The least H-eigenvalue of the signless Laplacian tensor of $G$ is simply called the least eigenvalue of $G…

math.CO2019

Eigenvectors of Z-tensors associated with least H-eigenvalue with application to hypergraphs

Yi-Zheng Fan, Yi Wang, Yan-Hong Bao

Unlike an irreducible $Z$ -matrices, a weakly irreducible $Z$ -tensor $A$ can have more than one eigenvector associated with the least H-eigenvalue. We show that there are…

math.CO2018★ 6 cited

The cyclic index of adjacency tensor of generalized power hypergraphs

Yi-Zheng Fan, Min Li

Let $G$ be a $t$ -uniform hypergraph, and let $c (G)$ denote the cyclic index of the adjacency tensor of $G$ . Let $m, s, t$ be positive integers such that $t \geq 2$ , $s \geq 2$ and $m=s…

math.CO2018★ 11 cited

Eigenvectors of Laplacian or signless Laplacian of Hypergraphs Associated with Zero Eigenvalue

Yi-Zheng Fan, Yi Wang, Yan-Hong Bao +3

Let $G$ be a connected $m$ -uniform hypergraph. In this paper we mainly consider the eigenvectors of the Laplacian or signless Laplacian tensor of $G$ associated with zero eigenvalu…

math.CO2018★ 10 cited

A Combinatorial Method for Computing Characteristic Polynomials of Starlike Hypergraphs

Yan-Hong Bao, Yi-Zheng Fan, Yi Wang +1

By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the chara…

math.CO2013

The triangle-free graphs with rank 6

Long Wang, Yi-Zheng Fan, Yi Wang

The rank of a graph G is defined to be the rank of its adjacency matrix A(G). In this paper we characterize all connected triangle-free graphs with rank 6.

math.CO2012★ 2 cited

Minimum Distance Spectral Radius of Graphs with Given Edge Connectivity

Xiao-Xin Li, Yi-Zheng Fan, Yi Wang

In this paper we determine the unique graph with minimum distance spectral radius among all connected graphs of fixed order and given edge connectivity.