
<p>In 2021, Gutman proposed a topological index for graphs known as the Sombor index. In this paper, we obtain several upper and lower bounds of the Sombor index of uniform hypergraphs, including those of hypertrees. Furthermore, we present a Nordhaus-Gaddum type result for the Sombor index of uniform hypergraphs.</p>
$ k $-uniform hypergraph, linear hypertree, QA1-939, nordhaus-gaddum type inequality, upper bound, lower bound, Mathematics, sombor index
$ k $-uniform hypergraph, linear hypertree, QA1-939, nordhaus-gaddum type inequality, upper bound, lower bound, Mathematics, sombor index
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
