Jiang Zhou

activity

20242026

collaborators

3 papers

math.CO2026

Spectral bounds for distance coloring and packing parameters of graphs via semidefinite programming

Aida Abiad, Yue Yang, Jiang Zhou

Using methods from spectral graph theory and semidefinite programming, we obtain sharp spectral bounds for several graph parameters related to distance colorings and packing, inclu…

math.CO2025

Spherical two-distance sets and graph eigenvalues

Jiang Zhou

A set of unit vectors in $R^{d}$ is a called a spherical two-distance set if the inner products of distinct vectors only take two values. In this paper, we give explicit cor…

math.CO2024

Unified bounds for the independence number of graph powers

Aida Abiad, Jiang Zhou

For a graph $G$ , its $k$ -th power $G^{k}$ is constructed by placing an edge between two vertices if they are within distance $k$ of each other. The $k$ -independence number $I^\pm_{k} (G)$ …