Computation of Tades of Some Families of Graphs

This study presents novel and efficient techniques for computing the Total Absolute Difference Edge Irregularity Strength (TADES) of several well-known graph families. Specifically, the focus remains on book graphs with pentagonal pages, the hairy cycle graph, and three-regular graphs. For these increasingly complex graph structures, innovative algorithmic methods are introduced that significantly reduce the computational complexity of determining TADES, thus contributing valuable insights and advancements to the study of graph theory.