H-irregularity strengths of plane graphs

Martin Bača, Nurdin Hinding, Aisha Javed, Andrea Semaničová-Feňovčíková

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

2 Citas (Scopus)

Resumen

Graph labeling is the mapping of elements of a graph (which can be vertices, edges, faces or a combination) to a set of numbers. The mapping usually produces partial sums (weights) of the labeled elements of the graph, and they often have an asymmetrical distribution. In this paper, we study vertex–face and edge–face labelings of two-connected plane graphs. We introduce two new graph characteristics, namely the vertex–face H-irregularity strength and edge–face H-irregularity strength of plane graphs. Estimations of these characteristics are obtained, and exact values for two families of graphs are determined.

Idioma originalInglés
Número de artículo229
Páginas (desde-hasta)1-11
Número de páginas11
PublicaciónSymmetry
Volumen13
N.º2
DOI
EstadoPublicada - feb. 2021
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'H-irregularity strengths of plane graphs'. En conjunto forman una huella única.

Citar esto