Show simple item record

dc.creatorCarmina, K. A.
dc.creatorSebastian, Reena
dc.date2013-05-01
dc.date.accessioned2019-11-14T11:58:47Z
dc.date.available2019-11-14T11:58:47Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/1120
dc.identifier10.4067/S0716-09172013000200002
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/112911
dc.descriptionA (p, q)-graph G is said to be square sum, if there exists a bijection f : V(G) — {0,1, 2,...,p — 1} such that the induced function f * : E(G) — N given by f * (uv) = (f (u))2 + (f (v))2 for every uv G E(G) is injective. In this paper we initiate a study on square sum graphs and prove that trees, unicyclic graphs, mCn,m > 1,cycle with a chord, the graph obtained by joining two copies of cycle Cn by a path Pk and the graph defined by path union of k copies of Cn, when the path Pn = P2 are square sum.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/1120/1160
dc.rightsDerechos de autor 2013 Proyecciones. Journal of Mathematicses-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 32 No 2 (2013); 107-117en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 32 Núm. 2 (2013); 107-117es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectSquare sum graphs.es-ES
dc.titleOn square sum graphses-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES


This item appears in the following Collection(s)

Show simple item record