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 ∈ 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...
Guardado en:
| Autores principales: | , , |
|---|---|
| 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!
|
| Sumario: | 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 ∈ 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›, T ‹ 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. |
|---|