On H-Irregularity Strength of Grid Graphs
Combinatorics
2021-10-22 v1
Abstract
This paper deals with three graph characteristics related to graph covering named the (vertex, edge, and total, resp.) H-irregularity strength of a graph G admitting H-covering. Those are the minimum values of positive integer k such that G has an H-irregular (vertex, edge, and total, resp.) k-labeling. The exact values of these three characteristics are determined for grid graph admitting grid-covering
Keywords
Cite
@article{arxiv.2110.10883,
title = {On H-Irregularity Strength of Grid Graphs},
author = {Meilin Imelda Tilukay},
journal= {arXiv preprint arXiv:2110.10883},
year = {2021}
}
Comments
6 pages