Skolem Difference Mean Graphs

A graph G = (V, E) with p vertices and q edges is said to have skolem difference mean labeling if it is possible to label the vertices x &#8712; V with distinct elements f (x) from 1, 2, 3,. . . ,p + q in such a way that for each edge <img src="http:/fbpe/img/proy/v34n3/art04_for1.jpg&qu...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Selvi,M., Ramya,D., Jeyanthi,P.
Lenguaje:English
Publicado: Universidad Católica del Norte, Departamento de Matemáticas 2015
Materias:
Acceso en línea:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172015000300004
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:scielo:S0716-09172015000300004
record_format dspace
spelling oai:scielo:S0716-091720150003000042015-09-23Skolem Difference Mean GraphsSelvi,M.Ramya,D.Jeyanthi,P. Mean labeling skolem difference mean labeling skolem difference mean graph extra skolem difference mean labeling A graph G = (V, E) with p vertices and q edges is said to have skolem difference mean labeling if it is possible to label the vertices x &#8712; V with distinct elements f (x) from 1, 2, 3,. . . ,p + q in such a way that for each edge <img src="http:/fbpe/img/proy/v34n3/art04_for1.jpg" width="300" height="42"> and the resulting labels of the edges are distinct and are from 1, 2, 3, . . . ,q. A graph that admits a skolem difference mean labeling is called a skolem difference mean graph. In this paper, we prove <img src="http:/fbpe/img/proy/v34n3/art04_for2.jpg" width="300" height="46"> T ( K1,n1 : K1,n2: . . . : K1,nm&#8250;, T &#8249; K1,n1 o K1,n2 o o o K1,nm), <img src="http:/fbpe/img/proy/v34n3/art04_for4.jpg" width="300" height="44"> are skolem difference mean graphs.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.34 n.3 20152015-09-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172015000300004en10.4067/S0716-09172015000300004
institution Scielo Chile
collection Scielo Chile
language English
topic Mean labeling
skolem difference mean labeling
skolem difference mean graph
extra skolem difference mean labeling
spellingShingle Mean labeling
skolem difference mean labeling
skolem difference mean graph
extra skolem difference mean labeling
Selvi,M.
Ramya,D.
Jeyanthi,P.
Skolem Difference Mean Graphs
description A graph G = (V, E) with p vertices and q edges is said to have skolem difference mean labeling if it is possible to label the vertices x &#8712; V with distinct elements f (x) from 1, 2, 3,. . . ,p + q in such a way that for each edge <img src="http:/fbpe/img/proy/v34n3/art04_for1.jpg" width="300" height="42"> and the resulting labels of the edges are distinct and are from 1, 2, 3, . . . ,q. A graph that admits a skolem difference mean labeling is called a skolem difference mean graph. In this paper, we prove <img src="http:/fbpe/img/proy/v34n3/art04_for2.jpg" width="300" height="46"> T ( K1,n1 : K1,n2: . . . : K1,nm&#8250;, T &#8249; K1,n1 o K1,n2 o o o K1,nm), <img src="http:/fbpe/img/proy/v34n3/art04_for4.jpg" width="300" height="44"> are skolem difference mean graphs.
author Selvi,M.
Ramya,D.
Jeyanthi,P.
author_facet Selvi,M.
Ramya,D.
Jeyanthi,P.
author_sort Selvi,M.
title Skolem Difference Mean Graphs
title_short Skolem Difference Mean Graphs
title_full Skolem Difference Mean Graphs
title_fullStr Skolem Difference Mean Graphs
title_full_unstemmed Skolem Difference Mean Graphs
title_sort skolem difference mean graphs
publisher Universidad Católica del Norte, Departamento de Matemáticas
publishDate 2015
url http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172015000300004
work_keys_str_mv AT selvim skolemdifferencemeangraphs
AT ramyad skolemdifferencemeangraphs
AT jeyanthip skolemdifferencemeangraphs
_version_ 1718439806856331264