H-Irregularity Strengths of Plane Graphs

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–...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Symmetry (Basel) 2021-02, Vol.13 (2), p.229
Hauptverfasser: Bača, Martin, Hinding, Nurdin, Javed, Aisha, Semaničová-Feňovčíková, Andrea
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2073-8994
2073-8994
DOI:10.3390/sym13020229