Extremal Zagreb indices of bicyclic hypergraphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915335439908864 |
|---|---|
| author | Zhou, Hong Bu, Changjiang |
| author_facet | Zhou, Hong Bu, Changjiang |
| contents | The Zagreb index of a hypergraph is defined as the sum of the squares of the degrees of its vertices. A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called bicyclic if $n=m(k-1)-1$. In this paper, we determine the hypergraphs with the maximum and minimum Zagreb indices among all linear bicyclic uniform hypergraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_08875 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Extremal Zagreb indices of bicyclic hypergraphs Zhou, Hong Bu, Changjiang Combinatorics The Zagreb index of a hypergraph is defined as the sum of the squares of the degrees of its vertices. A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called bicyclic if $n=m(k-1)-1$. In this paper, we determine the hypergraphs with the maximum and minimum Zagreb indices among all linear bicyclic uniform hypergraphs. |
| title | Extremal Zagreb indices of bicyclic hypergraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2506.08875 |