On Total Edge Irregularity Strength for Hexagonal Cell Snake Graph and Related Graphs
Farid Salama, Al-Madinah Al-Munawwarah · HAL (Le Centre pour la Communication Scientifique Directe) · 2020
A Graph labeling is one of the important mathematical discipline in graph theory where it serves many fields like computer science, coding theory, astronomy and physics. A labeling of edges and vertices of a simple graph (,) by a mapping : () ∪ () → { 1,2,3, … , ħ} provided that any two different edges have distinct weights is called an edge I irregular I total ħ-labeling. If ħ is minimum and G admits an edge irregular total ħ-labelling ,then it is called the total edge irregularity strength (TEIS) , denoted by (). In this paper, we defined which called hexagonal cell snake graph and a double hexagonal cell snake graph (). Moreover, the exact value of TEIS for the new graphs are determined.