k-super cube root cube mean labeling of some corona graphs
DOI:
https://doi.org/10.22199/issn.0717-6279-5200Keywords:
k-super cube root cube mean labeling, alternate snake graph, A(Tn) ʘ K₁, A(Tn) ʘ 2K₁, Tn ʘ K₁, A(Qn) ʘ K₁, Pn ʘ K₁,₃Abstract
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.
References
J.A Gallian, “A dynamic survey of graph labeling”, The Electronic Journal of Combinatorics, 2019, # DS6. [On line]. Available: https://bit.ly/2AojJ92
F. Harary, Graph Theory. Narosa publishing House Reading, New Delhi, 1988.
S. Kulandhai Therese and K. Romila, “Cube root Cube Mean labeling of Graphs”, International Journal of Mathematics Trends and Technology, vol. 65, no. 2, 2019. [On line]. Available: https://bit.ly/30Gy1wq
V. Princy Kala, “K-Super Cube root cube mean labeling of graphs”, Proyecciones (Antofagasta), vol. 40, no. 5, pp. 1097–1116, 2021. https://doi.org/10.22199/issn.0717-6279-4258
S. Somasundaram and R. Ponraj, “Mean labeling of graphs”, National Academy of Science Letters, vol. 26, pp. 210-213, 2013.
V. S. Radhika and A. Vijayan, “Super Cube root Cube Mean labeling of Graphs”, Journal of Science and Technology, vol. 5, pp. 17-24, 2020.
S. Sandhya, S. Somasundaram and S. Anusa, “Some More Results on Root Square mean Graphs”, Journal of Mathematics Research, vol. 7, no. 1, pp. 72-81, 2015. [On line]. Available: https://bit.ly/30DTCpd
Published
How to Cite
Issue
Section
Copyright (c) 2022 V. Princy Kala
This work is licensed under a Creative Commons Attribution 4.0 International License.
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.