Show simple item record

Combination labelings of graphs related to several cycles and paths

dc.creatorBusakorn, Aiewcharoen
dc.creatorBoonklurb, Ratinan
dc.creatorPromvichitkul, Sakulwat
dc.date2022-09-27
dc.date.accessioned2022-11-15T12:37:09Z
dc.date.available2022-11-15T12:37:09Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5250
dc.identifier10.22199/issn.0717-6279-5250
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/215687
dc.descriptionSuppose that G = (V (G), E(G)) is a graph and |V (G)| = p. If there exists a bijective function f : V (G) → {1, 2, 3, ..., p} such that an f c : E(G) → N defined by f c(uv) = (f(u)f(v))when f (u) > f(v) and f c(uv) = (f(u)f(v))when f (v) > f (u) is an injection function, then f  is called a combination labelings and G is called a combination graph. This article considers a suitable bijective function f and prove that G(Cn, Cm, Pk) which are graphs related to two cycles and one path containing three parameters, are combination 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/5250/4147
dc.rightsCopyright (c) 2022 Aiewcharoen Busakorn, Ratinan Boonklurb, Sakulwat Promvichitkulen-US
dc.rightshttps://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 41 No. 5 (2022); 1153-1172en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 41 Núm. 5 (2022); 1153-1172es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2022-05
dc.subjectgraph labelingen-US
dc.subjectcombinatorial labelingen-US
dc.subjectcycleen-US
dc.subjectpathen-US
dc.subject05C78en-US
dc.titleCombination labelings of graphs related to several cycles and pathsen-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