Total vertex product irregularity strength of graphs
Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh · Discussiones Mathematicae Graph Theory · 2023
Consider a simple graph G.We call a labeling w :The strength of w is s, the maximum number used to label the members of E(G) ∪ V (G).The minimum value of s that allows some irregular labeling is called the total vertex product irregularity strength and denoted tvps(G).We provide some general bounds, as well as exact values for chosen families of graphs.