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...
Enregistré dans:
| Auteurs principaux: | Jeyanthi,P., Selvi,M., Ramya,D. |
|---|---|
| Langue: | English |
| Publié: |
Universidad Católica del Norte, Departamento de Matemáticas
2017
|
| Sujets: | |
| Accès en ligne: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172017000200347 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Skolem Difference Mean Graphs
par: Selvi,M., et autres
Publié: (2015) -
Some results on skolem odd difference mean labeling
par: Jeyanthi,P, et autres
Publié: (2016) -
Restricted triangular difference mean graphs
par: Jeyanthi,P., et autres
Publié: (2020) -
Skolem Number of Cycles and Grid Graphs
par: Braxton Carrigan, et autres
Publié: (2021) -
Some new classes of vertex-mean graphs
par: Lourdusamy,A., et autres
Publié: (2017)