Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees (Q1753081)

From MaRDI portal
Revision as of 17:36, 15 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
scientific article

    Statements

    Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2018
    0 references
    Summary: Let \(\mathcal{A}(H)\) and \(\mathcal{Q}(H)\) be the adjacency tensor and signless Laplacian tensor of an \(r\)-uniform hypergraph \(H\). Denote by \(\rho(H)\) and \(\rho(\mathcal{Q}(H))\) the spectral radii of \(\mathcal{A}(H)\) and \(\mathcal{Q}(H)\), respectively. In this paper we present a lower bound on \(\rho(H)\) in terms of vertex degrees and we characterize the extremal hypergraphs attaining the bound, which solves a problem posed by \textit{V. Nikiforov} [Linear Algebra Appl. 457, 455--535 (2014; Zbl 1291.05142)]. Also, we prove a lower bound on \(\rho(\mathcal{Q}(H))\) concerning degrees and give a characterization of the extremal hypergraphs attaining the bound.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    uniform hypergraph
    0 references
    adjacency tensor
    0 references
    signless Laplacian tensor
    0 references
    spectral radius
    0 references
    0 references