Yinfeng Zhu

activity

20172026

collaborators

3 papers

math.CO2026

Paths maximize the expected range of graph-indexed random walks

Yinfeng Zhu

We prove that a path maximizes the expected range of a uniformly chosen graph homomorphism into the integers, with one vertex pinned at zero, among all connected bipartite graphs o…

math.CO2023

The least distance eigenvalue of the complements of graphs of diameter greater than three

Xu Chen, Yinfen Zhu, Guoping Wang

Suppose $G$ is a connected simple graph with the vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ . Let $d_{G} (v_{i}, v_{j})$ be the least distance between $v_{i}$ and $v_{j}$ in $G$ . Then…

math.CO2017

Half of an antipodal spherical design

Eiichi Bannai, Da Zhao, Lin Zhu +2

We investigate several antipodal spherical designs on whether we can choose half of the points, one from each antipodal pair, such that they are balanced at the origin. In particul…