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...
Saved in:
| 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!
|
Similar Items
-
On H-irregular reflexive labeling of graph
by: Marsidi Marsidi, et al.
Published: (2023-11-01) -
The Distance Irregular Reflexive k-Labeling of Graphs
by: Ika Hesti Agustin, et al.
Published: (2023-05-01) -
THE REFLEXIVE EDGE STRENGTH OF THE PENTAGONAL SNAKE GRAPH AND CORONA OF THE OPEN TRIANGULAR LADDER AND NULL GRAPH
by: Diari Indriati, et al.
Published: (2024-10-01) -
EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH
by: Thetania Miftakul Zalsa, et al.
Published: (2024-10-01) -
Development of a Korean Safety Ladder With Ensured Overturning Stability
by: Giyeol Lee, et al.
Published: (2025-03-01)