Exploring the Total Distance Vertex Irregular Labeling of Some Wheel‐Related Graphs and Its Computation
Mohamed Basher · Journal of Mathematics · 2026
Consider a simple graph ζ characterized by a vertex set V ( ζ ) and an edge set E ( ζ ). A distance vertex irregular total m‐labeling (DVITL) is a total m‐labeling from the set of vertices and edges, V ( ζ ) ∪ E ( ζ ), into a set of positive integers {1, 2, …, m }, where the vertex weights of any couple of separate vertices are different. The weight of a vertex x ∈ V ( ζ ) is the sum of the labels of all vertices adjacent to x and the labels of all edges incident to x . The total distance vertex irregularity strength of graph ζ , denoted as tdis ( ζ ), is described as the lowest value of m for which there exists a total distance vertex irregular labeling of ζ . The paper presents a calculation of the precise total distance vertex irregularity strength for several families of wheel graphs. These families are obtained through the subdivision of the wheel graphs into spokes, cycles, and barycentric subdivisions. We present the Python code implementation intended for executing DVITL on such graphs.