English

On the irregularity of uniform hypergraphs

Combinatorics 2018-02-08 v1

Abstract

Let HH be an rr-uniform hypergraph on nn vertices and mm edges, and let did_i be the degree of iV(H)i\in V(H). Denote by ε(H)\varepsilon(H) the difference of the spectral radius of HH and the average degree of HH. Also, denote s(H)=iV(H)dirmn, v(H)=1niV(H)dirr1(rmn)rr1. 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 rr-uniform hypergraph HH with respect to ε(H)\varepsilon(H), s(H)s(H) and v(H)v(H), which extend relevant results to uniform hypergraphs.

Keywords

Cite

@article{arxiv.1802.02146,
  title  = {On the irregularity of uniform hypergraphs},
  author = {Lele Liu and Liying Kang and Erfang Shan},
  journal= {arXiv preprint arXiv:1802.02146},
  year   = {2018}
}

Comments

14 pages

R2 v1 2026-06-23T00:13:32.375Z