#TITLE_ALTERNATIVE#
For a simple graph G=(V, E) with vertex set V and edge set E, a function λ : V∪E -> {1, 2, ... , k} is named a total k-labeling. The weight of an edge xy under a total k-labeling λ is defined as wt(xy) = λ(x) + λ(xy) + λ(y). A total k-labelin...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/9213 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | For a simple graph G=(V, E) with vertex set V and edge set E, a function λ : V∪E -> {1, 2, ... , k} is named a total k-labeling. The weight of an edge xy under a total k-labeling λ is defined as wt(xy) = λ(x) + λ(xy) + λ(y). A total k-labeling is called to be a total edge-irregular k-labeling of a graph G=(V,E) if, for every two different edges e and f of E, wt(e) ≠ wt(f). The minimum k for which a graph G has a total edge-irregular k-labeling is called the total edge irregularity strength of G, denoted by tes(G). We create an algorithm to count a tes(G) for some corona graphs. We also determine the total edge irregularity strength of the corona of a path with the complement of a complete graph. |
|---|