On ideal sumset labelled graphs
Abstract The sumset of two sets A and B of integers, denoted by A + B, is defined as A+B = {a+b : a ∈ A, b ∈ B}. Let X be a non-empty set of non-negative integers. A sumset labelling of a graph G is an injective function f : V (G) → P(X) − {∅} such t...
Guardado en:
| Autores principales: | , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000200371 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:scielo:S0716-09172021000200371 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720210002003712021-04-03On ideal sumset labelled graphsMathai,Jincy P.Naduvath,SudevSreedharan,Satheesh Graph labelling Set-labelling Sumset labelling Ideal sumset labelling Abstract The sumset of two sets A and B of integers, denoted by A + B, is defined as A+B = {a+b : a ∈ A, b ∈ B}. Let X be a non-empty set of non-negative integers. A sumset labelling of a graph G is an injective function f : V (G) → P(X) − {∅} such that the induced function f + : E(G) → P(X)−{∅} is defined by f+(uv) = f(u) +f(v) ∀uv ∈ E(G). In this paper, we introduce the notion of ideal sumset labelling of graph and discuss the admissibility of this labelling by certain graph classes and discuss some structural characterization of those graphs.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.40 n.2 20212021-04-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000200371en10.22199/issn.0717-6279-2021-02-0022 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
English |
| topic |
Graph labelling Set-labelling Sumset labelling Ideal sumset labelling |
| spellingShingle |
Graph labelling Set-labelling Sumset labelling Ideal sumset labelling Mathai,Jincy P. Naduvath,Sudev Sreedharan,Satheesh On ideal sumset labelled graphs |
| description |
Abstract The sumset of two sets A and B of integers, denoted by A + B, is defined as A+B = {a+b : a ∈ A, b ∈ B}. Let X be a non-empty set of non-negative integers. A sumset labelling of a graph G is an injective function f : V (G) → P(X) − {∅} such that the induced function f + : E(G) → P(X)−{∅} is defined by f+(uv) = f(u) +f(v) ∀uv ∈ E(G). In this paper, we introduce the notion of ideal sumset labelling of graph and discuss the admissibility of this labelling by certain graph classes and discuss some structural characterization of those graphs. |
| author |
Mathai,Jincy P. Naduvath,Sudev Sreedharan,Satheesh |
| author_facet |
Mathai,Jincy P. Naduvath,Sudev Sreedharan,Satheesh |
| author_sort |
Mathai,Jincy P. |
| title |
On ideal sumset labelled graphs |
| title_short |
On ideal sumset labelled graphs |
| title_full |
On ideal sumset labelled graphs |
| title_fullStr |
On ideal sumset labelled graphs |
| title_full_unstemmed |
On ideal sumset labelled graphs |
| title_sort |
on ideal sumset labelled graphs |
| publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
| publishDate |
2021 |
| url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000200371 |
| work_keys_str_mv |
AT mathaijincyp onidealsumsetlabelledgraphs AT naduvathsudev onidealsumsetlabelledgraphs AT sreedharansatheesh onidealsumsetlabelledgraphs |
| _version_ |
1718439897373605888 |