4 research outputs found

    On the α\alpha-spectral radius of hypergraphs

    Full text link
    For real α∈[0,1)\alpha\in [0,1) and a hypergraph GG, the α\alpha-spectral radius of GG is the largest eigenvalue of the matrix Aα(G)=αD(G)+(1−α)A(G)A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G), where A(G)A(G) is the adjacency matrix of GG, which is a symmetric matrix with zero diagonal such that for distinct vertices u,vu,v of GG, the (u,v)(u,v)-entry of A(G)A(G) is exactly the number of edges containing both uu and vv, and D(G)D(G) is the diagonal matrix of row sums of A(G)A(G). We study the α\alpha-spectral radius of a hypergraph that is uniform or not necessarily uniform. We propose some local grafting operations that increase or decrease the α\alpha-spectral radius of a hypergraph. We determine the unique hypergraphs with maximum α\alpha-spectral radius among kk-uniform hypertrees, among kk-uniform unicyclic hypergraphs, and among kk-uniform hypergraphs with fixed number of pendant edges. We also determine the unique hypertrees with maximum α\alpha-spectral radius among hypertrees with given number of vertices and edges, the unique hypertrees with the first three largest (two smallest, respectively) α\alpha-spectral radii among hypertrees with given number of vertices, the unique hypertrees with minimum α\alpha-spectral radius among the hypertrees that are not 22-uniform, the unique hypergraphs with the first two largest (smallest, respectively) α\alpha-spectral radii among unicyclic hypergraphs with given number of vertices, and the unique hypergraphs with maximum α\alpha-spectral radius among hypergraphs with fixed number of pendant edges

    On the α-Spectral Radius of Uniform Hypergraphs

    No full text
    For 0 ≤ α ---lt--- 1 and a uniform hypergraph G, the α-spectral radius of G is the largest H-eigenvalue of αD(G)+(1−α)A(G), where D(G) and A(G) are the diagonal tensor of degrees and the adjacency tensor of G, respectively. We give upper bounds for the α-spectral radius of a uniform hypergraph, propose some transformations that increase the α-spectral radius, and determine the unique hypergraphs with maximum α-spectral radius in some classes of uniform hypergraphs
    corecore