The Reflexive H-Strength on Some Graphs

Let G be a connected, simple, and undirected graph with a vertex set V(G) and an edge set E(G).  The irregular reflexive -labeling is defined by the function  and  such that  if  and  if , where  max . The irregular reflexive  labeling is called an -irregular reflexive -labeling of the graph  if eve...

Full description

Saved in:
Bibliographic Details
Main Authors: Lusia Herni Sullystiawati, Marsidi Marsidi, Eric Dwi Putra, Ika Hesti Agustin
Format: Article
Language:English
Published: Mathematics Department UIN Maulana Malik Ibrahim Malang 2024-05-01
Series:Cauchy: Jurnal Matematika Murni dan Aplikasi
Subjects:
Online Access:https://ejournal.uin-malang.ac.id/index.php/Math/article/view/23172
Tags: Add Tag
No Tags, Be the first to tag this record!