Solution to an open problem on the integral sum graphs
Let \(S\) be a finite subset of the set \(N\) of positive integers. The sum graph, denoted by \(G^t(S)\), is the graph \((S,E)\) such that for all \(u\), \(v\in S\), \(uv \in E\) if and only if \((u+v)\in S\), here \(S\) denotes the vertex set and \(E\) the edge set. The integral sum graph \(G^t(S)\) is merely the sum graph (defined as above) in which \(S\) is a subset of \({\mathcal Z}\) (the set of all integers) instead of \(N\). The following is the main theorem in this paper which results in the solution of an open problem posed by \textit{B. Xu} [Discrete Math. 194, 285--294 (1999; Zbl 0930.05086)]. Result: if \(n\) is any odd integer, then the cycle \(C_n\) is an integral sum graph. The authors provide a constructive method to show the above result.
This page was built for publication: Solution to an open problem on the integral sum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879676)
