Show simple item record

On ideal sumset labelled graphs

dc.creatorMathai, Jincy P.
dc.creatorNaduvath, Sudev
dc.creatorSreedharan, Satheesh
dc.date2021-03-01
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4011
dc.identifier10.22199/issn.0717-6279-2021-02-0022
dc.descriptionThe 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.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4011/3693
dc.rightsCopyright (c) 2021 Jincy P. Mathai, Sudev Naduvath, Satheesh Sreedharanen-US
dc.rightshttp://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 40 No. 2 (2021); 371-384en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 40 Núm. 2 (2021); 371-384es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2021-02
dc.subjectGraph labellingen-US
dc.subjectSet-labellingen-US
dc.subjectSumset labellingen-US
dc.subjectIdeal sumset labellingen-US
dc.subject05C78en-US
dc.subject11B13en-US
dc.titleOn ideal sumset labelled graphsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record