Year: 2024
Type: preprint
Abstract: Harary introduced the concepts of sum and integral sum graphs. A graph $G$ is a {\em 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 {\em integral sum graph} is also defined just as sum graph, the difference being that the labels may be any distinct integers. In this survey paper, we present results obtained on sum and integral sum graphs by different authors in detail.
Source: arXiv (Cornell University)
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Central University of Kerala
OpenAlex ID: W4400720156