Subdivided trees are integral sum graphs

DOI10.1016/J.DISC.2006.12.006MaRDI QIDQ2477401zbMATH OpenOpenAlexFDO

Authors Artem Pyatkin

Publication date 13 March 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.12.006

zbMATH Keywords

graph labelingintegral sum graphsubdivided tree

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1545005
• Some results on integral sum graphs with no saturated vertices
• Integral sum graphs from identification
• scientific article; zbMATH DE number 5307598
• On integral sum graphs

Cites work

• scientific article; zbMATH DE number 1792582 (Why is no real title available?)
• Integral sum graphs from identification
• New types of integral sum graphs
• On integral sum graphs
• Some results on sum graphs
• Sum graphs over all the integers

Cited in

(2)

• On integral sum graphs with a saturated vertex
• scientific article; zbMATH DE number 398970 (Why is no real title available?)

This page was built for publication: Subdivided trees are integral sum graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477401)