Subdivided trees are integral sum graphs (Q2477401)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5249213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subdivided trees are integral sum graphs |
scientific article; zbMATH DE number 5249213 |
Statements
Subdivided trees are integral sum graphs (English)
0 references
13 March 2008
0 references
A graph \(G\) is an integral sum (IS) graph if there exists a labeling of its vertices with distinct integers such that for every pair of distinct vertices \(u,v\in V(G)\), \(uv\in E(G)\) if and only if \(u+v\in V(G)\). IS graphs were introduced by \textit{F. Harary} [Discrete Math. 124, 99--105 (1994; Zbl 0797.05069)]. The main result of the paper is that every subdivided tree (each edge is subdivided by at least one vertex) is an IS graph.
0 references
graph labeling
0 references
subdivided tree
0 references
integral sum graph
0 references
0.8393819332122803
0 references
0.8341876268386841
0 references
0.8182333111763
0 references
