Abstract
Graph labeling is an algorithm that assigns labels (usually positive integers) to the edges and/or vertices under certain condition(s). Suppose G = (V, E) is a network (graph), with V(G) representing the vertex set and E(G) representing the edge set. The labeling is known as vertex labeling (or edge labeling), depending on whether the mapping domain is the vertex set (or edge set). In the same way, the labeling is called "total labeling" when the domain is V (G) ? E(G). In this article, we examine two types of eight-sided and four-faced or six-sided and four-faced planar maps that have an edge irregular reflexive k-labeling. Additionally, we find the precise value of the reflexive edge strength for these two classes.