The p-spectral radius of k-partite and k-chromatic uniform hypergraphs
Combinatorics
2014-02-11 v2
Abstract
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 order n.
Keywords
Cite
@article{arxiv.1402.0442,
title = {The p-spectral radius of k-partite and k-chromatic uniform hypergraphs},
author = {L. Kang and V. Nikiforov and X Yuan},
journal= {arXiv preprint arXiv:1402.0442},
year = {2014}
}
Comments
23 pages