124 research outputs found

    The extremal spectral radii of kk-uniform supertrees

    Full text link
    In this paper, we study some extremal problems of three kinds of spectral radii of kk-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence QQ-spectral radius). We call a connected and acyclic kk-uniform hypergraph a supertree. We introduce the operation of "moving edges" for hypergraphs, together with the two special cases of this operation: the edge-releasing operation and the total grafting operation. By studying the perturbation of these kinds of spectral radii of hypergraphs under these operations, we prove that for all these three kinds of spectral radii, the hyperstar Sn,k\mathcal{S}_{n,k} attains uniquely the maximum spectral radius among all kk-uniform supertrees on nn vertices. We also determine the unique kk-uniform supertree on nn vertices with the second largest spectral radius (for these three kinds of spectral radii). We also prove that for all these three kinds of spectral radii, the loose path Pn,k\mathcal{P}_{n,k} attains uniquely the minimum spectral radius among all kk-th power hypertrees of nn vertices. Some bounds on the incidence QQ-spectral radius are given. The relation between the incidence QQ-spectral radius and the spectral radius of the matrix product of the incidence matrix and its transpose is discussed

    Connected Hypergraphs with Small Spectral Radius

    Full text link
    In 1970 Smith classified all connected graphs with the spectral radius at most 22. Here the spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Recently, the definition of spectral radius has been extended to rr-uniform hypergraphs. In this paper, we generalize the Smith's theorem to rr-uniform hypergraphs. We show that the smallest limit point of the spectral radii of connected rr-uniform hypergraphs is ρr=(r1)!4r\rho_r=(r-1)!\sqrt[r]{4}. We discovered a novel method for computing the spectral radius of hypergraphs, and classified all connected rr-uniform hypergraphs with spectral radius at most ρr\rho_r.Comment: 20 pages, fixed a missing class in theorem 2 and other small typo
    corecore