#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 |
| id |
id-itb.:9213 |
|---|---|
| spelling |
id-itb.:92132017-09-27T11:43:03Z#TITLE_ALTERNATIVE# M. (NIM 10103025), SAMUEL Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/9213 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. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
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. |
| format |
Final Project |
| author |
M. (NIM 10103025), SAMUEL |
| spellingShingle |
M. (NIM 10103025), SAMUEL #TITLE_ALTERNATIVE# |
| author_facet |
M. (NIM 10103025), SAMUEL |
| author_sort |
M. (NIM 10103025), SAMUEL |
| title |
#TITLE_ALTERNATIVE# |
| title_short |
#TITLE_ALTERNATIVE# |
| title_full |
#TITLE_ALTERNATIVE# |
| title_fullStr |
#TITLE_ALTERNATIVE# |
| title_full_unstemmed |
#TITLE_ALTERNATIVE# |
| title_sort |
#title_alternative# |
| url |
https://digilib.itb.ac.id/gdl/view/9213 |
| _version_ |
1820664628015792128 |