Vladimir Nikiforov

activity

20152017

most citedThe spectral radius of graphs with no

K_{2, t}

minor

3 citations · 3 across the 2 of their papers we have counts for

collaborators

4 papers

math.CO2017★ 3 cited

The spectral radius of graphs with no $K_{2, t}$ minor

V. Nikiforov

Let $t \geq 3$ and $G$ be a graph of order $n,$ with no $K_{2, t}$ minor. If $n > 400 t^{6}$ , then the spectral radius $μ (G)$ satisfies \[ μ\left( G\right) \leq\frac{t-1}{2}…

math.CO2016

Hypergraphs and hypermatrices with symmetric spectrum

V. Nikiforov

It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate m…

math.CO2016

Max k-cut and the smallest eigenvalue

V. Nikiforov

Let $G$ be a graph of order $n$ and size $m$ , and let $mc_{k} (G)$ be the maximum size of a $k$ -cut of $G .$ It is shown that \[ \mathrm{mc}_{k}\left( G\right)…

math.CO2015

The trace norm of r-partite graphs and matrices

V. Nikiforov

The trace norm $∥ G ∥_{*}$ of a graph $G$ is the sum of its singular values, i.e., the absolute values of its eigenvalues. The norm $\left\Vert G\right\Vert _…

The spectral radius of graphs with no K2,t​ minor

Hypergraphs and hypermatrices with symmetric spectrum

Max k-cut and the smallest eigenvalue

The trace norm of r-partite graphs and matrices

The spectral radius of graphs with no $K_{2, t}$ minor