dc.creator | Princy Kala, V. | |
dc.date | 2022-07-28 | |
dc.date.accessioned | 2022-08-30T15:59:43Z | |
dc.date.available | 2022-08-30T15:59:43Z | |
dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5200 | |
dc.identifier | 10.22199/issn.0717-6279-5200 | |
dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/207111 | |
dc.description | Let 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.format | application/pdf | |
dc.language | eng | |
dc.publisher | Universidad Católica del Norte. | en-US |
dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5200/4093 | |
dc.rights | Copyright (c) 2022 V. Princy Kala | en-US |
dc.rights | https://creativecommons.org/licenses/by/4.0 | en-US |
dc.source | Proyecciones (Antofagasta, On line); Vol. 41 No. 4 (2022); 903-921 | en-US |
dc.source | Proyecciones. Revista de Matemática; Vol. 41 Núm. 4 (2022); 903-921 | es-ES |
dc.source | 0717-6279 | |
dc.subject | k-super cube root cube mean labeling | en-US |
dc.subject | alternate snake graph | en-US |
dc.subject | A(Tn) ʘ K₁ | en-US |
dc.subject | A(Tn) ʘ 2K₁ | en-US |
dc.subject | Tn ʘ K₁ | en-US |
dc.subject | A(Qn) ʘ K₁ | en-US |
dc.subject | Pn ʘ K₁,₃ | en-US |
dc.subject | 05C78 | en-US |
dc.title | k-super cube root cube mean labeling of some corona graphs | en-US |
dc.type | info:eu-repo/semantics/article | |
dc.type | info:eu-repo/semantics/publishedVersion | |
dc.type | Peer-reviewed Article | en-US |
dc.type | text | en-US |