Article
Cubic Root Mean Difference Labeling Of Graphs
Authors
and
Abstract
In a graph, G = (V ,E) with p vertices and q edges is said to be cubic root mean difference Labeling of graph if it is possible to label the vertices x ∈ V with distinct elements from in which each edge e = uv is labeled with then the edge labels are distinct. Here f is called a cubic root mean labeling of G. In this paper we prove the Jewel graph, prism grpah, ladder graph, comb graph and Triangular graph are cubic root mean labeling of graphs.
Keywords
Mean Labeling of graphs, cubic root mean labeling of graphs
Citation
H.m., T. S. & Sudhakar, V. (2020). Cubic root mean difference labeling of graphs. Turkish Journal of Computer and Mathematics Education, 11(3), 2327–2331.
T. S. H.m. and V. Sudhakar, “Cubic root mean difference labeling of graphs,” Turkish Journal of Computer and Mathematics Education, vol. 11, no. 3, pp. 2327–2331, 2020.
H.m. TS, Sudhakar V. Cubic root mean difference labeling of graphs. Turkish Journal of Computer and Mathematics Education. 2020;11(3):2327–2331.
H.m., T. S. and Sudhakar, V. (2020), ‘Cubic root mean difference labeling of graphs’, Turkish Journal of Computer and Mathematics Education, 11(3), pp. 2327–2331.
H.m., Tanveera Sultana, and V.j. Sudhakar. “Cubic Root Mean Difference Labeling of Graphs.” Turkish Journal of Computer and Mathematics Education, vol. 11, no. 3, 2020, pp. 2327–2331.
H.m., Tanveera Sultana, and V.j. Sudhakar. “Cubic Root Mean Difference Labeling of Graphs.” Turkish Journal of Computer and Mathematics Education 11, no. 3 (2020): 2327–2331.
Export citation
Published by: Engineering Journals


