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: | 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!
|
Ejemplares similares
-
Skolem difference mean labeling of disconnected graphs
por: Jeyanthi,P., et al.
Publicado: (2017) -
Some results on skolem odd difference mean labeling
por: Jeyanthi,P, et al.
Publicado: (2016) -
Skolem Number of Cycles and Grid Graphs
por: Braxton Carrigan, et al.
Publicado: (2021) -
Restricted triangular difference mean graphs
por: Jeyanthi,P., et al.
Publicado: (2020) -
Some new classes of vertex-mean graphs
por: Lourdusamy,A., et al.
Publicado: (2017)