Computing Total Edge Irregularity Strength for Heptagonal Snake Graph and Related Graphs
Fatma Salama Β· Research Square Β· 2021
Abstract A labeling of edges and vertices of a simple graph πΊ(π,πΈ) by a mapping Ε¦:π(πΊ) βͺ πΈ(πΊ)β{ 1,2,3,β¦,Π} provided that any two pair of edges have distinct weights is called an edge irregular total Π-labeling. If Π is minimum and πΊ admits an edge irregular total Π -labelling, then Π is called the total edge irregularity strength (TEIS) and denoted by π‘ππ (πΊ). In this paper, the definitions of the heptagonal snake graph HPSn ,the double heptagonal snake graph π·(HPSn) and an πβmultiple heptagonal snake graph πΏ(HPSn) have been introduced. The exact value of TEISs for the new family has also been investigated.