Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number (Q2232678)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
scientific article

    Statements

    Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number (English)
    0 references
    0 references
    0 references
    0 references
    8 October 2021
    0 references
    Summary: In this paper, we defined two classes of hypergraphs, hyperbugs and kite hypergraphs. We show that balanced hyperbugs maximize the spectral radii of hypergraphs with fixed number of vertices and diameter and kite hypergraphs minimize the spectral radii of hypergraphs with fixed number of vertices and clique number.
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references