The distance vertex irregular total k-labelings on graph G(V, E) is a mapping f : V (G) ∪ E(G) → {1, 2,..., k} such as for every u, v ∈ V (G) and u ≠ v, the weight of u is not equal to the weight of v. The weight of any vertex u ∈ V (G) evaluate based on the neighborhood of vertices and the neighborhood of edges of u. The total distance vertex irregularity strength of G denote by tdis(G), is the minimum of the biggest label k over all distance vertex irregular total k-labelings of G. In this paper, we determine the total distance vertex irregularity strength of fan and wheel graphs.
展开▼
