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...
Saved in:
| Main Authors: | , , |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2017
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172017000200347 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|