Skolem difference mean labeling of disconnected graphs
Abstract Let G = (V , E) be a graph with p vertices and q edges. G is said to have skolem difference mean labeling if it is possible to label the vertices with distinct elements ƒ (x) from 1,2,2,…, p + q in such a way that for each edge and the resulting labels of the edges are...
Guardado en:
| Autores principales: | , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2017
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172017000200347 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:scielo:S0716-09172017000200347 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720170002003472017-07-06Skolem difference mean labeling of disconnected graphsJeyanthi,P.Selvi,M.Ramya,D. mean labeling skolem difference mean labeling skolem difference mean graph Abstract Let G = (V , E) be a graph with p vertices and q edges. G is said to have skolem difference mean labeling if it is possible to label the vertices with distinct elements ƒ (x) from 1,2,2,…, p + q in such a way that for each edge and the resulting labels of the edges are distinct and are from 1,2,2,…, q. A graph that admits a skolem difference mean labeling is called a skolem difference mean graph. In this paper, we prove that the graphs graphs.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.36 n.2 20172017-06-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172017000200347en10.4067/S0716-09172017000200347 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
English |
| topic |
mean labeling skolem difference mean labeling skolem difference mean graph |
| spellingShingle |
mean labeling skolem difference mean labeling skolem difference mean graph Jeyanthi,P. Selvi,M. Ramya,D. Skolem difference mean labeling of disconnected graphs |
| description |
Abstract Let G = (V , E) be a graph with p vertices and q edges. G is said to have skolem difference mean labeling if it is possible to label the vertices with distinct elements ƒ (x) from 1,2,2,…, p + q in such a way that for each edge and the resulting labels of the edges are distinct and are from 1,2,2,…, q. A graph that admits a skolem difference mean labeling is called a skolem difference mean graph. In this paper, we prove that the graphs graphs. |
| author |
Jeyanthi,P. Selvi,M. Ramya,D. |
| author_facet |
Jeyanthi,P. Selvi,M. Ramya,D. |
| author_sort |
Jeyanthi,P. |
| title |
Skolem difference mean labeling of disconnected graphs |
| title_short |
Skolem difference mean labeling of disconnected graphs |
| title_full |
Skolem difference mean labeling of disconnected graphs |
| title_fullStr |
Skolem difference mean labeling of disconnected graphs |
| title_full_unstemmed |
Skolem difference mean labeling of disconnected graphs |
| title_sort |
skolem difference mean labeling of disconnected graphs |
| publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
| publishDate |
2017 |
| url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172017000200347 |
| work_keys_str_mv |
AT jeyanthip skolemdifferencemeanlabelingofdisconnectedgraphs AT selvim skolemdifferencemeanlabelingofdisconnectedgraphs AT ramyad skolemdifferencemeanlabelingofdisconnectedgraphs |
| _version_ |
1718439824018374656 |