Integral sum graphs from identification
A graph \(G= (V,E)\) is an integral sum graph if there is a function \(f:V\to\mathbb{Z}\) such that, for all \(u,v\in V\) with \(u\neq v\), we have \(\{u,v\}\in E\) iff \(f(w)= f(u)+ f(v)\) for some \(w\in V\). The notion of identification is used to prove for some graphs that they are integral sum graphs. An identification is the operation that takes two graphs and yields the graph obtained by identifying a specified vertex from both graphs. Conditions are given under which the identification of a caterpillar or a path with an integral sum graph yields an integral sum graph. This is used to prove that all generalized stars (trees with at most one vertex of degree at least three) and all trees with all vertices of degree at least three at distance at least four are integral sum graphs. The author conjectures that every tree is an integral sum graph.
- A family of sparse graphs of large sum number
- Harary's conjectures on integral sum graphs
- scientific article; zbMATH DE number 4130422 (Why is no real title available?)
- scientific article; zbMATH DE number 426366 (Why is no real title available?)
- scientific article; zbMATH DE number 4148140 (Why is no real title available?)
- Parallel concepts in graph theory
- Sum graphs over all the integers
- Subdivided trees are integral sum graphs
- On integral sum graphs with a saturated vertex
- scientific article; zbMATH DE number 1545005 (Why is no real title available?)
- Banana trees and union of stars are integral sum graphs.
- Integral sum graphs from a class of trees.
- scientific article; zbMATH DE number 2230271 (Why is no real title available?)
- On integral sum graphs
This page was built for publication: Integral sum graphs from identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1381849)
