Entire labeling of plane graphs


Abstract:

A face irregular entire k-labeling j ϕ: V υE υF →{1,2,., k} of a 2-connected plane graph G = (V, E, F) is a labeling of vertices, edges and faces of G in such a way that for any two different faces f and g their weights w<inf>ϕ</inf> (f) and w<inf>ϕ</inf> (g) are distinct. The weight of a face f under a k-labeling ϕ is the sum of labels carried by that face and all the edges and vertices incident with the face. The minimum k for which a plane graph G has a face irregular entire k-labeling is called the entire face irregularity strength. We investigate a face irregular entire labeling as a modification of the well-known vertex irregular and edge irregular total labelings of graphs. We obtain some estimations on the entire face irregularity strength and determine the precise values for graphs from three families of plane graphs.

Año de publicación:

2015

Keywords:

  • Entire face irregularity strength
  • face irregular entire k-labeling
  • Plane graph

Fuente:

scopusscopus

Tipo de documento:

Article

Estado:

Acceso restringido

Áreas de conocimiento:

  • Teoría de grafos
  • Algoritmo
  • Lógica

Áreas temáticas de Dewey:

  • Principios generales de matemáticas
  • Geometría
  • Programación informática, programas, datos, seguridad
Procesado con IAProcesado con IA

Objetivos de Desarrollo Sostenible:

  • ODS 10: Reducción de las desigualdades
  • ODS 11: Ciudades y comunidades sostenibles
  • ODS 16: Paz, justicia e instituciones sólidas
Procesado con IAProcesado con IA