Peer-reviewedCC BY 4.0Mathematics
Modular Total H-Irregularity Strength of Graphs
- 1Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, Slovakia
- 2Division of Mathematics, Saveetha School of Engineering, SIMATS, Chennai 602 105, India
Abstract
We investigate the modular total H-irregularity strength, a modular variant of the total H-irregularity strength of graphs. We establish a sufficient condition under which these two graph invariants coincide. As applications of this result, we determine the exact values of the modular total H-irregularity strength for several graph families. In each case, the obtained value attains the corresponding lower bound, proving that the bound is sharp.
Related
- Total Vertex Irregularity Strength of Cubic and 4-Regular Graphs
- Endomorphisms of Total Kneser Graphs
- The parameterised complexity of generalised temporal domination on temporal graphs with modular structure
- Domination and Total Domination in Johnson graphs
- Total-coloring of planar graphs with maximum degree 6 and without prescribed 4-cycles
BibTeX
@article{baca2026modular,
title = {{Modular Total H-Irregularity Strength of Graphs}},
author = {Martin Bača and Marcela Lascsáková and Andrea Semaničová-Feňovčíková},
journal = {Mathematics},
year = {2026},
month = oct,
doi = {10.3390/math14203666},
url = {https://www.mdpi.com/2227-7390/14/20/3666},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Modular Total H-Irregularity Strength of Graphs
AU - Martin Bača
AU - Marcela Lascsáková
AU - Andrea Semaničová-Feňovčíková
PY - 2026
DA - 2026/10/10
JO - Mathematics
DO - 10.3390/math14203666
UR - https://www.mdpi.com/2227-7390/14/20/3666
AB - We investigate the modular total H-irregularity strength, a modular variant of the total H-irregularity strength of graphs. We establish a sufficient condition under which these two graph invariants coincide. As applications of this result, we determine the exact values of the modular total H-irregularity strength for several graph families. In each case, the obtained value attains the corresponding lower bound, proving that the bound is sharp.
SN - 2227-7390
ER -