On The Total Irregularity Strength of Regular Graphs
Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 ∪ 𝐸 → {1, 2, ⋯ , 𝑘} is called a totally irregular total 𝑘-labeling of 𝐺 if every two distinct vertices 𝑥 and 𝑦 in 𝑉 satisfy 𝑤𝑓(𝑥) ≠ 𝑤𝑓(𝑦) and every two distinct edges 𝑥1𝑥2 and 𝑦1𝑦2 in 𝐸 satisfy 𝑤𝑓(𝑥1𝑥2) ≠ 𝑤𝑓(𝑦1𝑦2), where 𝑤𝑓(𝑥) = 𝑓(𝑥) + Σ𝑥𝑧∈𝐸(𝐺) 𝑓(𝑥𝑧)...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
ITB Journal Publisher
2015-12-01
|
| Series: | Journal of Mathematical and Fundamental Sciences |
| Subjects: | |
| Online Access: | http://journals.itb.ac.id/index.php/jmfs/article/view/1253 |