The Distance Irregular Reflexive k-Labeling of Graphs
A total k-labeling is a function fe from the edge set to the set {1, 2, . . . , ke} and a function fv from the vertex set to the set {0, 2, 4, . . . , 2kv}, where k = max{ke, 2kv}. A distance irregular reflexive k-labeling of the graph G is the total k-labeling, if for every two different vertices u...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mathematics Department UIN Maulana Malik Ibrahim Malang
2023-05-01
|
| Series: | Cauchy: Jurnal Matematika Murni dan Aplikasi |
| Subjects: | |
| Online Access: | https://ejournal.uin-malang.ac.id/index.php/Math/article/view/19747 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|