Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = vertex–face (edge–face) H-irregularity strength

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
11 pages, 339 KiB  
Article
H-Irregularity Strengths of Plane Graphs
by Martin Bača, Nurdin Hinding, Aisha Javed and Andrea Semaničová-Feňovčíková
Symmetry 2021, 13(2), 229; https://doi.org/10.3390/sym13020229 - 30 Jan 2021
Cited by 2 | Viewed by 1986
Abstract
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 [...] Read more.
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. Full article
(This article belongs to the Special Issue Graph Labelings and Their Applications)
Show Figures

Figure 1

Back to TopTop