The reflexive edge strength on some almost regular graphs

Abstract

A function f with domain and range are respectively the edge set of graph G and natural number up to ke, and a function f with domain and range are respectively the vertex set of graph G and the even natural number up to 2kv are called a total k-labeling where k=max{ke,2kv}. The total k-labeling of graph G by the condition that every two different edges have different weight is called an edge irregular reflexive k-labeling, where for any edge x1x2, the weight is wt(x1x2)=fv(x1)+fe(x1x2)+fv(x2). The reflexive edge strength of the graph G, denoted by res(G) is the minimum k for graph G which has an edge irregular reflexive k-labelling. In this study, we obtained the res(G) of graphs which their vertex degrees show an almost regularity properties.

Keywords

• Edge irregular reflexive k-labeling
• Reflexive edge strength
• Ladder graph
• Triangular ladder
• Pn×C3
• Pn⊙P2