The labeling of a graph G is said to be Weighted Mean Labeling(WML), if its vertices are labelled from {0,1,2,…,q}, where q is the number of edges of G such that the edges of G, can be labelled with ⌈(f(δ) deg⁡(δ)+f(μ)deg⁡(μ))/(deg⁡(δ)+deg⁡(μ))⌉ the resulting edge labels are distinct from {1,2,…,q}. If a graph G admits WML, then G is said to be Weighted Mean Graph (WMG). In this paper, we have discussed the WML of some Standard Graphs.