Edge Irregular Reflexive Labeling of Some Families of Ladder Graphs

Authors

  • Mohammed Ali Alghamdi Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia.
  • Dina Abuzaid Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia.
  • Ali Ahmad Department of Computer Science, College of Engineering and Computer Science, Jazan University, Jazan, Saudi Arabia.

Keywords:

Edge irregular reflexive labeling, reflexive edge strength, ladder graph, sub-divided graphs

Abstract

The aim of this paper is to investigate reflexive edge strength in graph theory, defined as the specialized area of an edge that is irregularly labeled, where both vertices and edges are labeled. The reflexive edge strength, res(G), is the minimal value of k for which the sum of weights of any two different edges in agraph is distinct. In this paper, reflexive edge strength of b-subdivided ladder graphs and the triangular ladder graph studied.

Downloads

Download data is not yet available.

Downloads

Published

2024-12-31

Issue

Vol. 20 No. 2 (2024): Journal of Prime Research in Mathematics

Section

Regular

How to Cite

Edge Irregular Reflexive Labeling of Some Families of Ladder Graphs. (2024). Journal of Prime Research in Mathematics, 20(2), 77 – 92. https://jprm.sms.edu.pk/index.php/jprm/article/view/233