@article{Carmina_Sebastian_1, title={On square sum graphs}, volume={32}, url={https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/1120}, DOI={10.4067/S0716-09172013000200002}, abstractNote={<em>A (p, q)-graph G is said to be square sum, if there exists a bijection f </em>: V(G) → {0,1, 2,...,p — 1} <em>such that the induced function f * </em>: E(G) → <em>N given by f * (uv) = </em>(f <em>(u))<sup>2</sup> </em>+ (f (v))<sup>2</sup> <em> for every uv </em>∈ E(G) <em>is injective. In this paper we initiate a study on square sum graphs and prove that trees, unicyclic graphs, mC<sub>n</sub>, m </em>&gt; <em>1, cycle with a chord, the graph obtained by joining two copies of cycle C<sub>n</sub> by a path P<sub>k</sub> and the graph defined by path union of k copies of C<sub>n</sub>, when the path P<sub>n</sub> </em> = P<sub>2</sub> <em> are square sum.</em>}, number={2}, journal={Proyecciones (Antofagasta, On line)}, author={Carmina, K. A. and Sebastian, Reena}, year={1}, month={1}, pages={107-117} }