Computation of Total Vertex Irregularity Strength of Theta Graphs
A total labeling Φ : V (G) ∪ E(G) → {1, 2, ... , k} is called a vertex irregular total k-labeling of a graph G if different vertices in G have different weights. The weight of a vertex is defined as the sum of the labels of its incident edges and the label of that ve...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8786105/ |