Searcharxiv⌕ Search

arXiv subjects

Chunli Deng

Publications and source records attributed to Chunli Deng.

3 recordsLinked to original sources

On the Motzkin-Straus theorem and clique number for k-uniform hypergraphs

In this paper, we establish a Motzkin-Straus type equality for k-uniform hypergraphs under certain conditions, which extends the classical Motzkin--Straus theorem for graphs. Using this equality, we present several spectral bounds for the clique number of k-uniform hypergraphs in terms of the spectral radii of the adjacency, signless Laplacian, and Laplacian tensors. When k=2, the bounds coincide with the corresponding known results for graphs.

math.CO↗

The geometry connectivity of hypergraphs

Let $\mathcal{G}$ be a $k$-uniform hypergraph, $\mathcal{L}_{\mathcal{G}}$ be its Laplacian tensor. And $β( \mathcal{G})$ denotes the maximum number of linearly independent nonnegative eigenvectors of $\mathcal{L}_{\mathcal{G}}$ corresponding to the eigenvalue $0$. In this paper, $β( \mathcal{G})$ is called the geometry connectivity of $\mathcal{G}$. We show that the number of connected components of $\mathcal{G}$ equals the geometry connectivity $β( \mathcal{G})$.

math.CO↗