4 citations · 10 across the 8 of their papers we have counts for
8 papers
The spectral radius of graphs with no minor
V. Nikiforov
Let and be a graph of order with no minor. If , then the spectral radius satisfies \[ μ\left( G\right) \leq\frac{t-1}{2}…
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…
Combinatorial methods for the spectral p-norm of hypermatrices
V. Nikiforov
The spectral -norm of -matrices generalizes the spectral -norm of -matrices. In 1911 Schur gave an upper bound on the spectral -norm of -matrices, which was exten…
Max k-cut and the smallest eigenvalue
V. Nikiforov
Let be a graph of order and size , and let be the maximum size of a -cut of It is shown that \[ \mathrm{mc}_{k}\left( G\right)…
The trace norm of r-partite graphs and matrices
V. Nikiforov
The trace norm of a graph is the sum of its singular values, i.e., the absolute values of its eigenvalues. The norm $\left\Vert G\right\Vert _…
The p-spectral radius of k-partite and k-chromatic uniform hypergraphs
L. Kang, V. Nikiforov, X Yuan
We characterize the r-graph with maximal p-spectral radius among the k-partite r-graphs of order n, and the 3-graph with maximal p-spectral radius among the k-chromatic 3-graphs of…
An asymptotically tight bound on the Q-index of graphs with forbidden cycles
V. Nikiforov
Let G be a graph of order n and let q(G) be that largest eigenvalue of the signless Laplacian of G. In this note it is shown that if k>1 and q(G)>=n+2k-2, then G contains cycles of…
Maxima of the Q-index: degenerate graphs
V. Nikiforov
Let be a -degenerate graph of order It is well-known that has no more edges than the join of a complete graph of order and an independent set of ord…