New developments on graph sum index

Abstract: For a finite simple graph $G=(V,\ E)$, the \emph{sum index} of $G$ is defined to be \begin{align*} S(G)=\min{|{f(u)+f(v):\ uv\in E}|:\ f:V\lhook\joinrel\longrightarrow \mathbb{Z}}. \end{align*} In this paper, from several different aspects, we show some new developments on graph sum index. Firstly, we determine the sum indices of the complete multipartite graphs, hypercubes, and some cluster graphs. Then, we study the maximum number of edges in a graph with a fixed sum index, which is related to the forbidden subgraph problem. Also, we show some relations between graph sum indices and results in additive combinatorics.