Publication Date

1-1-2021

Document Type

Article

Publication Title

AKCE International Journal of Graphs and Combinatorics

Volume

18

Issue

1

DOI

10.1080/09728600.2021.1931555

First Page

53

Last Page

59

Abstract

We define a total k-labeling (Formula presented.) of a graph G as a combination of an edge labeling (Formula presented.) and a vertex labeling (Formula presented.) such that (Formula presented.) if (Formula presented.) and (Formula presented.) if (Formula presented.) where (Formula presented.) The total k-labeling (Formula presented.) is called an edge irregular reflexive k-labeling of G if every two different edges has distinct edge weights, where the edge weight is defined as the summation of the edge label itself and its two vertex labels. Thus, the smallest value of k for which the graph G has the edge irregular reflexive k-labeling is called the reflexive edge strength of G. In this paper, we study the edge irregular reflexive labeling of corona product of two paths and corona product of a path with isolated vertices. We determine the reflexive edge strength for these graphs.

Funding Number

59609

Funding Sponsor

Ministry of Higher Education, Malaysia

Keywords

complete graph, corona product, Edge irregular reflexive labeling, path, reflexive edge strength

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.

Department

Mathematics and Statistics

Download

Share

COinS