Total irregularity strength of some cubic graphs
Abstract Let G = (V;E) be a graph. A total labeling ψ : V ⋃ E → {1, 2, ....k} is called totally irregular total k-labeling of G if every two distinct vertices u and v in V (G) satisfy wt(u) ≠wt(v); and every two distinct edges u 1 u 2 and v 1 v 2 in E(G) sa...
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-09172021000400905 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|