A homogeneous polynomial associated with general hypergraphs and its applications
classification
🧮 math.CO
keywords
generalhomogeneouspolynomialcliquehypergraphnumberradiusspectral
read the original abstract
In this paper, we define a homogeneous polynomial for a general hypergraph, and establish a remarkable connection between clique number and the homogeneous polynomial of a general hypergraph. For a general hypergraph, we explore some inequality relations among spectral radius, clique number and the homogeneous polynomial. We also give lower and upper bounds on the spectral radius in terms of the clique number.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.