arXiv Analytics

Sign in

arXiv:1802.02146 [math.CO]AbstractReferencesReviewsResources

On the irregularity of uniform hypergraphs

Lele Liu, Liying Kang, Erfang Shan

Published 2018-02-06Version 1

Let $H$ be an $r$-uniform hypergraph on $n$ vertices and $m$ edges, and let $d_i$ be the degree of $i\in V(H)$. Denote by $\varepsilon(H)$ the difference of the spectral radius of $H$ and the average degree of $H$. Also, denote \[ s(H)=\sum_{i\in V(H)}\left|d_i-\frac{rm}{n}\right|,~ v(H)=\frac{1}{n}\sum_{i\in V(H)}d_i^{\frac{r}{r-1}}-\left(\frac{rm}{n}\right)^{\frac{r}{r-1}}. \] In this paper, we investigate the irregularity of $r$-uniform hypergraph $H$ with respect to $\varepsilon(H)$, $s(H)$ and $v(H)$, which extend relevant results to uniform hypergraphs.

Related articles: Most relevant | Search more
arXiv:2109.03507 [math.CO] (Published 2021-09-08)
Lower bounds for the $\mathcal{A}_α$-spectral radius of uniform hypergraphs
arXiv:2311.03341 [math.CO] (Published 2023-11-06)
On polynomial degree-boundedness
arXiv:0707.2117 [math.CO] (Published 2007-07-14)
Cycle lengths in sparse graphs