.png){kind=icon}
.png){kind=icon}
Return
New Developments on Graph Sum Index
.png){kind=icon}
PRE
AI
DOI：10.1007/s00373-026-03035-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In a graph, we assign distinct integers to the vertices, and take the sum of two integers if they are on two adjacent vertices. The minimum possible number of different sums is the sum index of this graph. In this paper, we present some new developments on graph sum index. First, we explain the connections between graph sum index and results in additive combinatorics. Then, we determine the sum indices of the complete multipartite graphs, hypercubes, and some cluster graphs. Also, we study the maximum number of edges in a graph with a fixed sum index, which is related to the forbidden subgraph problem.
Keywords:
Graph labeling
Sum index
Sumset