Sum and integral sum graphs -- A survey

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Beineke, Lowell W., Kamalappan, V. Vilfred
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910527876235264
author Beineke, Lowell W.
Kamalappan, V. Vilfred
author_facet Beineke, Lowell W.
Kamalappan, V. Vilfred
contents Frank Harary introduced the concepts of sum and integral sum graphs. A graph $G$ is a \textit{sum graph} if the vertices of $G$ can be labeled with distinct positive integers so that $e = uv$ is an edge of $G$ if and only if the sum of the labels on vertices $u$ and $v$ is also a label in $G.$ An \textit{integral sum graph} is also defined just as sum graph, the difference being that the labels may be any distinct integers. In this survey article, the authors bring out several properties of sum and integral sum graphs obtained by different authors.
format Preprint
id arxiv_https___arxiv_org_abs_2407_10917
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Sum and integral sum graphs -- A survey
Beineke, Lowell W.
Kamalappan, V. Vilfred
Combinatorics
05C78, 05C15, 05C75
Frank Harary introduced the concepts of sum and integral sum graphs. A graph $G$ is a \textit{sum graph} if the vertices of $G$ can be labeled with distinct positive integers so that $e = uv$ is an edge of $G$ if and only if the sum of the labels on vertices $u$ and $v$ is also a label in $G.$ An \textit{integral sum graph} is also defined just as sum graph, the difference being that the labels may be any distinct integers. In this survey article, the authors bring out several properties of sum and integral sum graphs obtained by different authors.
title Sum and integral sum graphs -- A survey
topic Combinatorics
05C78, 05C15, 05C75
url https://arxiv.org/abs/2407.10917