Show simple item record

dc.creatorPrincy Kala, V.
dc.date2022-07-28
dc.date.accessioned2022-08-30T15:59:43Z
dc.date.available2022-08-30T15:59:43Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5200
dc.identifier10.22199/issn.0717-6279-5200
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/207111
dc.descriptionLet G be a graph with |V (G)| = p and |E (G)| = q and f : V (G) → {k, k+1, k+2,..., p+q+k − 1 } be an one-to-one function. The induced edge labeling f ∗, for a vertex labeling f is defined by f ∗(e) = for all e = uv ∈ E(G) is bijective. If f(V (G)) ∪ {f ∗(e) : e ∈ E(G)} = {k, k+1, k+2,..., p+q+k − 1}, then f is known as a k-super cube root cube mean labeling. If such labeling exists, then G is a k-super cube root cube mean graph. In this paper, I prove that Tn ʘ K1, A(Tn) ʘ K1, A(Tn) ʘ 2K1, A(Qn) ʘ K1, Pn ʘ K1,2 and Pn ʘ K1,3 are k-super cube root cube mean 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/5200/4093
dc.rightsCopyright (c) 2022 V. Princy Kalaen-US
dc.rightshttps://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 41 No. 4 (2022); 903-921en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 41 Núm. 4 (2022); 903-921es-ES
dc.source0717-6279
dc.subjectk-super cube root cube mean labelingen-US
dc.subjectalternate snake graphen-US
dc.subjectA(Tn) ʘ K₁en-US
dc.subjectA(Tn) ʘ 2K₁en-US
dc.subjectTn ʘ K₁en-US
dc.subjectA(Qn) ʘ K₁en-US
dc.subjectPn ʘ K₁,₃en-US
dc.subject05C78en-US
dc.titlek-super cube root cube mean labeling of some corona 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