#TITLE_ALTERNATIVE#
Let G=(V,E) be grafph and k be positif integer. A mapping lamda :V(G) U E(G) -> {1,2,3,..., k} is called a vertex irregular total k-labelling if the weights of all vertices in G are different.In this Final Project, we succeded verify this conjecture for all trees with the number of vertices at mo...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/17834 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Let G=(V,E) be grafph and k be positif integer. A mapping lamda :V(G) U E(G) -> {1,2,3,..., k} is called a vertex irregular total k-labelling if the weights of all vertices in G are different.In this Final Project, we succeded verify this conjecture for all trees with the number of vertices at most 20. |
|---|