KEKUATAN SISI REFLEKSIF PADA GRAF RANTAI SEGITIGA

(Reflexive Edge Strenght on Triangular Chain Graph)

  • Wulan Indah Saputri Program Studi Matematika, Fakultas Matematika dan Ilmu Pengetahuan Alam, Universitas Sebelas Maret, Surakarta
  • Diari Indiarti Program Studi Matematika, Fakultas Matematika dan Ilmu Pengetahuan Alam, Universitas Sebelas Maret, Surakarta

Abstract

Given a simple connected graph  with set of vertices is  and set of edge is . A graph  is called to have an edge irregular reflexive -labeling if each vertices can be labeled with an even positive integer  and each edge can be labeled with a positive integer  such that each edge has a different weight. The weight of an edge  on a graph  is the sum of the vertex label , vertex label , and  edge label. The reflexive edge strenght of a graph  denoted by  is the minimum  of the largest label in graph  with . In this paper, we determine the reflexive edge strenght of the triangular chain graph -path for . The reflexive edge strenght of the triangular chain graph -path is 3 for ,  for  is even and , and  for  is odd.


Keywords: Edge irregular reflexive labeling, reflexive edge strenght, and triangular chain graph

Published
2022-08-15
How to Cite
SAPUTRI, Wulan Indah; INDIARTI, Diari. KEKUATAN SISI REFLEKSIF PADA GRAF RANTAI SEGITIGA. UNEJ e-Proceeding, [S.l.], p. 418 - 425, aug. 2022. Available at: <https://jurnal.unej.ac.id/index.php/prosiding/article/view/33531>. Date accessed: 25 dec. 2024.
Citation Formats
Issue
2022: E-Prosiding Seminar Nasional Matematika, Geometri, Statistika, dan Komputasi (SeNa-MaGeStiK)
Section
General