Entire Labeling of Plane Graphs

Martin Bača, Stanislav JendroǏ, Kumarappan Kathiresan, Kadarkarai Muthugurupackiam

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

Resumen

A face irregular entire k-labeling (Formula presented) 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φ(f) and wφ(g) are distinct. The weightofaface f under a k-labeling φ is the sum of labels carried by that face and all the edges and vertices incident withthe 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.

Idioma originalInglés
Páginas (desde-hasta)263-267
Número de páginas5
PublicaciónApplied Mathematics and Information Sciences
Volumen9
N.º1
DOI
EstadoPublicada - ene. 2015
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'Entire Labeling of Plane Graphs'. En conjunto forman una huella única.

Citar esto