On H-Irregularity Strengths of Square Chain Graphs

Authors

DOI:

https://doi.org/10.22487/2540766X.2026.v23.i1.17989

Keywords:

H-irregular vertex labeling, H-irregular edge labeling, H-irregular total labeling, square chain graph

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  SCn for n>=1. Furthermore, by establishing matching lower and upper bounds, the exact values of the vertex, edge, and total SCm-irregularity strengths of SCn are determined for all m with 1<=m<=n.

Downloads

Published

2026-06-30

Issue

Vol. 23 No. 1 (2026)

Section

Articles

How to Cite

On H-Irregularity Strengths of Square Chain Graphs. (2026). JURNAL ILMIAH MATEMATIKA DAN TERAPAN, 23(1), 1-10. https://doi.org/10.22487/2540766X.2026.v23.i1.17989