KEKUATAN SISI REFLEKSIF PADA GRAF RANTAI SEGITIGA

(Reflexive Edge Strenght on Triangular Chain Graph)

Authors

  • 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

Downloads

Download data is not yet available.

Downloads

Published

2022-08-15

Issue

2022: E-Prosiding Seminar Nasional Matematika, Geometri, Statistika, dan Komputasi (SeNa-MaGeStiK)

Section

General