Total edge irregularity strength of strong product of two paths


Abstract:

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 (x<inf>1</inf>,x<inf>2</inf>) and (y<inf>1</inf>,y<inf>2</inf>) are adjacent whenever for each i ε {1,2} either X<inf>i</inf> = y<inf>i</inf> or x<inf>1</inf>y<inf>1</inf> ε E(G<inf>i</inf>). An edge irregular total k-labeling φ : V ∪ E → {1,2, ...,k} of a graph G = (V, E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x<sup>′</sup>y <sup>′</sup> their weights φ(x) + φ(xy) + φ(y) and φ(x<sup>′</sup>) + φ(x<sup>′</sup>y<sup>′</sup>) + φ(y<sup>′</sup>) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. We have determined the exact value of the total edge irregularity strength of the strong product of two paths P<inf>n</inf> and P<inf>m</inf>. Copyright © 2012, Charles Babbage Research Centre All rights reserved.

Año de publicación:

2012

Keywords:

  • Edge irregular total labeling
  • Irregularity strength
  • Strong product of paths
  • total edge irregularity strength

Fuente:

scopusscopus

Tipo de documento:

Article

Estado:

Acceso restringido

Áreas de conocimiento:

  • Teoría de grafos
  • Optimización matemática
  • Algoritmo

Áreas temáticas de Dewey:

  • Matemáticas
  • Principios generales de matemáticas
  • Álgebra
Procesado con IAProcesado con IA

Objetivos de Desarrollo Sostenible:

  • ODS 17: Alianzas para lograr los objetivos
  • ODS 10: Reducción de las desigualdades
  • ODS 9: Industria, innovación e infraestructura
Procesado con IAProcesado con IA