Some new classes of vertex-mean graphs
Abstract: A vertex-mean labeling of a(p, q) graph G = ( V, E) is defined as an injective function such that the function defined by the rule satisfies the property that , where Ev denotes the set of edgesin G that are incident at v, N denotes the set of all natural numbers and Round is t...
Guardado en:
Autores principales: | , |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2017
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172017000200283 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
id |
oai:scielo:S0716-09172017000200283 |
---|---|
record_format |
dspace |
spelling |
oai:scielo:S0716-091720170002002832017-07-06Some new classes of vertex-mean graphsLourdusamy,A.Seenivasan,M. Mean labeling edge labeling vertex-mean labeling vertex-mean graphs Abstract: A vertex-mean labeling of a(p, q) graph G = ( V, E) is defined as an injective function such that the function defined by the rule satisfies the property that , where Ev denotes the set of edgesin G that are incident at v, N denotes the set of all natural numbers and Round is the it nearest integer function. A graph that has a vertex-mean labeling is called vertex-mean graph or V - mean graph. In this paper, we study V - mean behaviour of certain new classes of graphs and present a method to construct disconnected V - mean graphs.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.36 n.2 20172017-06-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172017000200283en10.4067/S0716-09172017000200283 |
institution |
Scielo Chile |
collection |
Scielo Chile |
language |
English |
topic |
Mean labeling edge labeling vertex-mean labeling vertex-mean graphs |
spellingShingle |
Mean labeling edge labeling vertex-mean labeling vertex-mean graphs Lourdusamy,A. Seenivasan,M. Some new classes of vertex-mean graphs |
description |
Abstract: A vertex-mean labeling of a(p, q) graph G = ( V, E) is defined as an injective function such that the function defined by the rule satisfies the property that , where Ev denotes the set of edgesin G that are incident at v, N denotes the set of all natural numbers and Round is the it nearest integer function. A graph that has a vertex-mean labeling is called vertex-mean graph or V - mean graph. In this paper, we study V - mean behaviour of certain new classes of graphs and present a method to construct disconnected V - mean graphs. |
author |
Lourdusamy,A. Seenivasan,M. |
author_facet |
Lourdusamy,A. Seenivasan,M. |
author_sort |
Lourdusamy,A. |
title |
Some new classes of vertex-mean graphs |
title_short |
Some new classes of vertex-mean graphs |
title_full |
Some new classes of vertex-mean graphs |
title_fullStr |
Some new classes of vertex-mean graphs |
title_full_unstemmed |
Some new classes of vertex-mean graphs |
title_sort |
some new classes of vertex-mean graphs |
publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
publishDate |
2017 |
url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172017000200283 |
work_keys_str_mv |
AT lourdusamya somenewclassesofvertexmeangraphs AT seenivasanm somenewclassesofvertexmeangraphs |
_version_ |
1718439823226699776 |