A homogeneous polynomial associated with general hypergraphs and its applications

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…