On the total irregularity strength of convex polytope graphs
Abstract A vertex (edge) irregular total k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, . . . , k} in such a way that any two different vertices (edges) have distinct weights. Here, the weight of a vertex x in G is the sum of the label...
Saved in:
| Main Authors: | , , |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000501267 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|