New developments on graph sum index

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Desai, Dheer Noal, Wang, Runze
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915411913605120
author Desai, Dheer Noal
Wang, Runze
author_facet Desai, Dheer Noal
Wang, Runze
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2410_16494
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle New developments on graph sum index
Desai, Dheer Noal
Wang, Runze
Combinatorics
05C78 (Primary) 05C35, 11B13 (Secondary)
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.
title New developments on graph sum index
topic Combinatorics
05C78 (Primary) 05C35, 11B13 (Secondary)
url https://arxiv.org/abs/2410.16494