The overall variation in vertex connections within a graph, known as the total irregularity, is quantified by summing half the absolute differences between the degrees of every vertex pair. This study investigates how this measure of irregularity behaves when a graph undergoes two specific transformations: the creation of a k-subdivision and the Kr-gluing of two graphs.