68 citations · 503 across the 48 of their papers we have counts for
8 papers · 1 filter
Graph Automorphisms from the Geometric Viewpoint
Wen-Xue Du, Yi-Zheng Fan
An automorphism of a graph is a bijective map from to itself such that for any two vertices and .…
A lower bound for the algebraic connectivity of a graph in terms of the domination number
Yi-Zheng Fan, Ying-Ying Tan
We investigate how the algebraic connectivity of a graph changes by relocating a connected branch from one vertex to another vertex, and then minimize the algebraic connectivity am…
The signature of line graphs and power trees
Long Wang, Yi-Zheng Fan
Let be a graph and let be the adjacency matrix of . The signature of is the difference between the positive inertia index and the negative inertia index of…
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
Yi-Zheng Fan, Ying-Ying Tan
Let be a connected non-bipartite graph on vertices with domination number . We investigate the least eigenvalue of the signless Laplacian of , and pr…
Symmetric Toeplitz-Structured Compressed Sensing Matrices
Tao Huang, Yi-Zheng Fan, Ming Zhu
How to construct a suitable measurement matrix is still an open question in compressed sensing. A significant part of the recent work is that the measurement matrices are not compl…
Mixed Compressed Sensing Based on Random Graphs
Yi-Zheng Fan, Tao Huang, Ming Zhu
Finding a suitable measurement matrix is an important topic in compressed sensing. Though the known random matrix, whose entries are drawn independently from a certain probability…