The total irregularity strength of m copies of the friendship graph

This paper deals with the totally irregular total labeling of the disjoin union of friendship graphs. The results shows that the disjoin union of  copies of the friendship graph is a totally irregular total graph with the exact values of the total irregularity strength equals to its edge irregular total strength

On the total irregularity strength of the corona product of a path with path

This paper deals with the totally irregular total labeling of the corona product of a path with path, cycle, and star. The results gave the exact values of the total irregularity strength of , , and , for integer and

Some Types of Irregular Labeling of Diamond Networks on Ten Vertices

There are three interesting parameters in irregular networks based on total labelling, i.e. the total vertex irregularity strength, the total edge irregularity strength, and the total irregularity strength of a graph. Besides that, there is a parameter based on edge labelling, i.e., the irregular labelling. In this paper, we determined the four parameters for diamond graph on eight vertices

Group Irregularity Strength of Connected Graphs

We investigate the group irregularity strength ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group \gr of order $s$, there exists a function f:E(G)\rightarrow \gr such that the sums of edge labels at every vertex are distinct. We prove that for any connected graph $G$ of order at least 3, $s_g(G)=n$ if $n\neq 4k+2$ and $s_g(G)\leq n+1$ otherwise, except the case of some infinite family of stars