Show simple item record

dc.creatorZhang, Xiujun
dc.creatorCancan, Murat
dc.creatorNadeem, Muhammad Faisal
dc.creatorImran , Muhammad
dc.date2020-07-28
dc.date.accessioned2020-07-29T16:38:00Z
dc.date.available2020-07-29T16:38:00Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4262
dc.identifier10.22199/issn.0717-6279-2020-04-0049
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/147137
dc.descriptionEdge irregular mapping or vertex mapping h : V (U ) ?? {1, 2, 3, 4, ..., s} is a mapping of vertices in such a way that all edges have distinct weights. We evaluate weight of any edge by using equation wth(cd) = h(c)+h(d), ?c, d ? V (U ) and ?cd ? E(U ). Edge irregularity strength denoted by es(U ) is a minimum positive integer use to label vertices to form edge irregular labeling. In this paper, we find exact value of edge irregularity strength of different families of comb graph.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/4262/3465
dc.rightsCopyright (c) 2020 Xiujun Zhang, Murat Cancan, Muhammad Faisal Nadeem, Muhammad Imranen-US
dc.rightshttp://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 39 No. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 787-797en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 39 Núm. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 787-797es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2020-04
dc.subjectIrregular assignmenten-US
dc.subjectIrregularity strengthen-US
dc.subjectEdge irregularity strengthen-US
dc.subjectComb graphsen-US
dc.subject05C78en-US
dc.subjectGraph labelling (graceful graphs, bandwidth, etc.)en-US
dc.titleEdge irregularity strength of certain families of comb graphen-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