On extremal spectral radius of blow-up uniform hypergraphs
Abstract
Let G be an r-uniform hypergraph of order t and (G) is the spectral radius of A(G), where A(G) is the adjacency tensor of G. A blow-up of G respected to a positive integer vector (n1, n2,…,nt), denoted by G (n1, n2,…,nt), is an r-uniform hypergraph obtained from G by replacing each vertex j of G with a class of vertices Vj of size nj 1 and if \j1,j2,…,jr\∈ E(G), then \vi1,vi2,…,vir\∈ E(H) for every vi1∈ Vj1, vi2∈ Vj2,…, vir∈ Vjr. Let Bn(G) be the set of all the blow-ups of G such that each ni 1 and Σi=1n ni=n. Let Ktr be the complete r-uniform hypergraph of order t, and let SH(m,q,r) be the r-uniform sunflower hypergraph with m petals and a kernel of size r-q on t vertices. For any H∈ Bn(Ktr), we prove that (Ktr(n-t+1,1,1,…,1))≤(H)≤ (Ttr(n)), with the left equality holds if and only if H Ktr(n-t+1,1,1,…,1), and the right equality holds if and only if H Ttr(n), where Ttr(n) is the complete t-partite r-uniform hypergraph of order n, with parts of size n / k or n / k . For any H∈ Bn(H(m,q,r)), we determine the exact value of the spectral radius of H and characterize the hypergraphs with maximum spectral radius and minimum spectral radius in Bn(H(m,q,r)), respectively.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.