On total edge irregularity strength of strong product of two cycles
Abstract:
An edge irregular total k-labeling of a graph G = (V, E) is a labeling ℓ: V ∪ E → {1, 2,⋯, k} such that the total edge-weights wt(ab) = ℓ(a) + ℓ(ab) + ℓ(b) are different for all pairs of distinct edges. The minimum k for which the graph G has an edge irregular total Relabeling is called the total edge irregularity strength of G. The strong product G<inf>1</inf> G<inf>2</inf> of graphs G<inf>1</inf> and G<inf>2</inf> is the graph with V(G<inf>1</inf>) × V(G<inf>2</inf>) as the vertex set, and two distinct vertices (a<inf>1</inf>,a<inf>2</inf>) and (b<inf>1</inf>,b<inf>2</inf>) are adjacent whenever for each i ϵ {1, 2} either a<inf>i</inf> = b<inf>i</inf> or a<inf>i</inf>b<inf>i</inf> ϵ E(G<inf>i</inf>). In this paper, we determine the exact value of the total edge irregularity strength of the strong product of two cycles C<inf>n</inf> and C<inf>m</inf>.
Año de publicación:
2017
Keywords:
- total edge irregularity strength
- Irregular assignments
- Edge irregular total labeling
- Strong product. MR (2010) subject Classification: 05C78
Fuente:
scopusTipo de documento:
Article
Estado:
Acceso restringido
Áreas de conocimiento:
- Teoría de grafos
- Optimización matemática
- Optimización matemática
Áreas temáticas de Dewey:
- Ciencias de la computación
Objetivos de Desarrollo Sostenible:
- ODS 9: Industria, innovación e infraestructura
- ODS 17: Alianzas para lograr los objetivos
- ODS 8: Trabajo decente y crecimiento económico