#TITLE_ALTERNATIVE#
Let G = (V,E) be a simple and finite graph with a vertex-set V and an edge-set E. A super edge-magic total labeling of a graph G is an injective function from V∪E to {1,2,...,|V|+|E|} with f(V)={1,2,...,|V|} such that there exists a constant k, named a magic constant, satisfying f(x)+f(xy)...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/7152 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Let G = (V,E) be a simple and finite graph with a vertex-set V and an edge-set E. A super edge-magic total labeling of a graph G is an injective function from V∪E to {1,2,...,|V|+|E|} with f(V)={1,2,...,|V|} such that there exists a constant k, named a magic constant, satisfying f(x)+f(xy)+f(y) = k for each xy∈E. A graph having a super edge-magic total labeling is called a total super edge-magic graph. In this final project we consider a super edge-magic total labeling of an expansion of the star Smn for n ≥ 3 and m≥ 0. The main focus is constructing a super edgemagic total labeling using a labeling algorithm, which will be implemented in a language program. |
|---|