Jiang Zhou

most citedUnified bounds for the independence number of graphs

4 citations · 5 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

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.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 $α_{k} (G)$ i…

math.CO2024★ 4 cited

Unified bounds for the independence number of graphs

Jiang Zhou

The Hoffman ratio bound, Lovász theta function and Schrijver theta function are classical upper bounds for the independence number of graphs, which are useful in graph theory, extr…

math.CO2024★ 1 cited

A combinatorial problem related to the classical probability

Jiang Zhou

In the classical probability model, let $f (n)$ be the maximum number of pairwise independent events for the sample space with $n$ sample points. The determination of $f (n)$ is equi…

math.CO2024

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…