On H-Irregularity Strengths of Square Chain Graphs

Abstract

This paper investigates three types of graph labeling schemes, namely H-irregular vertex, edge, and total labeling. These labeling frameworks are examined in the context of square chain graphs  SC_n for n>=1. Furthermore, by establishing matching lower and upper bounds, the exact values of the vertex, edge, and total SC_m-irregularity strengths of SC_n are determined for all m with 1<=m<=n.