New developments on graph sum index
Combinatorics
2025-07-29 v2
Abstract
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 \emph{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
Cite
@article{arxiv.2410.16494,
title = {New developments on graph sum index},
author = {Dheer Noal Desai and Runze Wang},
journal= {arXiv preprint arXiv:2410.16494},
year = {2025}
}