Sombor index of uniform hypergraphs

Abstract

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.

Keywords

• sombor index
• $ k $-uniform hypergraph
• linear hypertree
• nordhaus-gaddum type inequality
• lower bound
• upper bound