#TITLE_ALTERNATIVE#

#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)...

Full description

Saved in:
Bibliographic Details
Main Author: MUHAMMAD TAUFIK (NIM 10102039), ALLAN
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
id id-itb.:7152
spelling id-itb.:71522017-09-27T11:43:03Z#TITLE_ALTERNATIVE# MUHAMMAD TAUFIK (NIM 10102039), ALLAN Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/7152 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. 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 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.
format Final Project
author MUHAMMAD TAUFIK (NIM 10102039), ALLAN
spellingShingle MUHAMMAD TAUFIK (NIM 10102039), ALLAN
#TITLE_ALTERNATIVE#
author_facet MUHAMMAD TAUFIK (NIM 10102039), ALLAN
author_sort MUHAMMAD TAUFIK (NIM 10102039), ALLAN
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/7152
_version_ 1820664065230372864

Similar Items