On Distance Vertex Irregular Total k-Labeling
Let H= (T,S), be a finite simple graph, T(H)= T and S(H)= S, respectively, are the sets of vertices and edges on H. Let σ:T∪S→1,2,· · · ,k, be a total k-labeling on H and wσ(x), be a weight of x∈T while using σ labeling, which is evaluated based on the total number of all vertices labels in the neig...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Magister Program of Material Sciences, Graduate School of Universitas Sriwijaya
2023-07-01
|
| Series: | Science and Technology Indonesia |
| Subjects: | |
| Online Access: | https://sciencetechindonesia.com/index.php/jsti/article/view/748/340 |