Volume 66 | Issue 3 | Year 2020 | Article Id. IJMTT-V66I3P518 | DOI : https://doi.org/10.14445/22315373/IJMTT-V66I3P518
Let G = (V,E) be an undirected graph with p vertices and q edges. Define a function f:V(G)->{1,2,3,.....,q+1} is called Minkowski-4 Mean Labeling of a graph G if we could able to label the vertices x ε V with distinct elements from 1,2,...., q+1 such that it induces an edge labeling f*: E(G) -> {1,2,3,....,q+1} defined as, f* (e=uv) = [ (f(u)4+f(v)4/2)1/4], is distinct for all edges e =uv ε E. (i,e.) It indicates that the distinct vertex labeling induces a distinct edge labeling on the graph. The graph which admits Minkowski-4 Mean Labeling is called a Minkowski-4 Mean Graph. In this paper, we have investigated the Minkowski-4 Mean Labeling of some standard graphs like Path, Comb, Caterpillar, Pn Θ K1,2, etc.
[1] Douglas B. West, Introduction to Graph Theory, Second Edition, PHI Learning Private Limited (2009).
[2] Gallian. J. A, A Dynamic Survey of Graph Labeling, The Electronic Journal of combinatorics(2013).
[3] Harary.F, Graph Theory, Narosa publishing House, New Delhi.
[4] Ponraj.R and Somasundaram.S, "Mean Labeling of graphs," in National Academy of Science Letters, vol.26, pp.210-213, 2003.
[5] Sandhya.S.S, Somasundaram.S and Anusa.S, "Root Square Mean Labeling of Graph," International Journal of Contemporary Mathematical Sciences, Vol.9, 2014,no. 667-676.
[6] Sandhya.S.S, Somasundaram.S and Anusa.S, "Some More Results on Root Square Mean Labeling of Graphs," Journal of Mathematics Research, Vol. 7,No.1;2015.
[7] Sandhya.S.S, Somasundaram.S and Anusa.S, "Root Square Labeling of Some New Disconnected Graphs, "International Journal of Mathematics Trends and Technology, volume 15, number 2,2014. page no : 85-92.
M.Kaaviya Shree, K.Sharmilaa, "Minkowski-4 Mean Labeling of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 66, no. 3, pp. 114-118, 2020. Crossref, https://doi.org/10.14445/22315373/IJMTT-V66I3P518