arXiv:1801.02784 [math.CO]AbstractReferencesReviewsResources
Spectral Radius of $\{0, 1\}$-Tensor with Prescribed Number of Ones
Published 2018-01-09Version 1
For any $r$-order $\{0, 1\}$-tensor $A$ with $e$ ones, we prove that the spectral radius of $A$ is at most $e^{\frac{r-1}{r}}$ with the equality holds if and only if $e={k^r}$ for some integer $k$ and all ones forms a principal sub-tensor ${\bf 1}_{k\times \cdots \times k}$. We also prove a stability result for general tensor $A$ with $e$ ones where $e=k^r+l$ with relatively small $l$. Using the stability result, we completely characterized the tensors achieving the maximum spectral radius among all $r$-order $\{0, 1\}$-tensor $A$ with $k^r+l$ ones, for $-r-1\leq l \leq r$, and $k$ sufficiently large.
Comments: 29 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1509.07372 [math.CO] (Published 2015-09-24)
On the spectral radius of simple digraphs with prescribed number of arcs
arXiv:0712.1301 [math.CO] (Published 2007-12-08)
The maximum spectral radius of C_4-free graphs of given order and size
arXiv:2207.03045 [math.CO] (Published 2022-07-07)
The maximum spectral radius of graphs of given size with forbidden subgraph