On square sum graphs
A (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))² + (f (v))² for every uv G E(G) is injective. In this paper we initiate a study on square sum graphs and prove that trees, un...
Guardado en:
| Autores principales: | , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2013
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172013000200002 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:scielo:S0716-09172013000200002 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720130002000022013-06-26On square sum graphsGermina,K. A.Sebastian,Reena Square sum graphs A (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))² + (f (v))² 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.32 n.2 20132013-05-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172013000200002en10.4067/S0716-09172013000200002 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
English |
| topic |
Square sum graphs |
| spellingShingle |
Square sum graphs Germina,K. A. Sebastian,Reena On square sum graphs |
| description |
A (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))² + (f (v))² 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. |
| author |
Germina,K. A. Sebastian,Reena |
| author_facet |
Germina,K. A. Sebastian,Reena |
| author_sort |
Germina,K. A. |
| title |
On square sum graphs |
| title_short |
On square sum graphs |
| title_full |
On square sum graphs |
| title_fullStr |
On square sum graphs |
| title_full_unstemmed |
On square sum graphs |
| title_sort |
on square sum graphs |
| publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
| publishDate |
2013 |
| url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172013000200002 |
| work_keys_str_mv |
AT germinaka onsquaresumgraphs AT sebastianreena onsquaresumgraphs |
| _version_ |
1718439789229768704 |