On extremal spectral radius of blow-up uniform hypergraphs
arXiv:2302.06822
Abstract
Let be an -uniform hypergraph of order and is the spectral radius of , where is the adjacency tensor of . A blow-up of respected to a positive integer vector , denoted by , is an -uniform hypergraph obtained from by replacing each vertex of with a class of vertices of size and if , then for every . Let be the set of all the blow-ups of such that each and . Let be the complete -uniform hypergraph of order , and let be the -uniform sunflower hypergraph with petals and a kernel of size on vertices. For any , we prove that with the left equality holds if and only if , and the right equality holds if and only if , where is the complete -partite -uniform hypergraph of order , with parts of size or . For any , we determine the exact value of the spectral radius of and characterize the hypergraphs with maximum spectral radius and minimum spectral radius in , respectively.
16 pages