On Integral Sum Graphs

Zhibo Chen

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f(u)+f(v) = f(w) for some node w in G. A node of G is called a saturated node if it is adjacent to every other node of G. We show that any integral sum graph which is not K3 has at most two saturated nodes. We determine the structure for all integral sum graphs with exactly two saturated nodes, and give an upper bound for the number of edges of a connected integral sum graph with no saturated nodes. We introduce a method of identification on constructing new connected integral sum graphs from given integral sum graphs with a saturated node. Moreover, we show that every graph is an induced subgraph of a connected integral sum graph. Miscellaneous relative results are also presented.

Original languageEnglish (US)
Pages (from-to)117-127
Number of pages11
JournalElectronic Notes in Discrete Mathematics
Volume11
DOIs
StatePublished - Jul 1 2002

Fingerprint

Labeling
Graph in graph theory
Vertex of a graph
Distinct
Induced Subgraph
Adjacent
Upper bound
If and only if
Integer

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

Chen, Zhibo. / On Integral Sum Graphs. In: Electronic Notes in Discrete Mathematics. 2002 ; Vol. 11. pp. 117-127.
@article{85c0de0c100b42ee99e0ebf01616c166,
title = "On Integral Sum Graphs",
abstract = "A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f(u)+f(v) = f(w) for some node w in G. A node of G is called a saturated node if it is adjacent to every other node of G. We show that any integral sum graph which is not K3 has at most two saturated nodes. We determine the structure for all integral sum graphs with exactly two saturated nodes, and give an upper bound for the number of edges of a connected integral sum graph with no saturated nodes. We introduce a method of identification on constructing new connected integral sum graphs from given integral sum graphs with a saturated node. Moreover, we show that every graph is an induced subgraph of a connected integral sum graph. Miscellaneous relative results are also presented.",
author = "Zhibo Chen",
year = "2002",
month = "7",
day = "1",
doi = "10.1016/S1571-0653(04)00060-5",
language = "English (US)",
volume = "11",
pages = "117--127",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",

}

On Integral Sum Graphs. / Chen, Zhibo.

In: Electronic Notes in Discrete Mathematics, Vol. 11, 01.07.2002, p. 117-127.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On Integral Sum Graphs

AU - Chen, Zhibo

PY - 2002/7/1

Y1 - 2002/7/1

N2 - A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f(u)+f(v) = f(w) for some node w in G. A node of G is called a saturated node if it is adjacent to every other node of G. We show that any integral sum graph which is not K3 has at most two saturated nodes. We determine the structure for all integral sum graphs with exactly two saturated nodes, and give an upper bound for the number of edges of a connected integral sum graph with no saturated nodes. We introduce a method of identification on constructing new connected integral sum graphs from given integral sum graphs with a saturated node. Moreover, we show that every graph is an induced subgraph of a connected integral sum graph. Miscellaneous relative results are also presented.

AB - A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f(u)+f(v) = f(w) for some node w in G. A node of G is called a saturated node if it is adjacent to every other node of G. We show that any integral sum graph which is not K3 has at most two saturated nodes. We determine the structure for all integral sum graphs with exactly two saturated nodes, and give an upper bound for the number of edges of a connected integral sum graph with no saturated nodes. We introduce a method of identification on constructing new connected integral sum graphs from given integral sum graphs with a saturated node. Moreover, we show that every graph is an induced subgraph of a connected integral sum graph. Miscellaneous relative results are also presented.

UR - http://www.scopus.com/inward/record.url?scp=34247092553&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247092553&partnerID=8YFLogxK

U2 - 10.1016/S1571-0653(04)00060-5

DO - 10.1016/S1571-0653(04)00060-5

M3 - Article

AN - SCOPUS:34247092553

VL - 11

SP - 117

EP - 127

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

ER -