SUPER EDGE-MAGIC TOTAL LABELINGS OF A THETA GRAPH 0 (2,b,c)

Let ???? be a simple and finite graph with the vertex set ????(????) and the edge set ????(????). An edge magic labeling on ???? is an injective function ???? from ????(????)?????(????) to a subset of integers {1,2,…,|????(????)?????(????)|} with the property that there is a positive integer ???? su...

Full description

Saved in:
Bibliographic Details
Main Author: Mujtahid, Zainul
Format: Theses
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/41778
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:41778
spelling id-itb.:417782019-09-02T10:00:56ZSUPER EDGE-MAGIC TOTAL LABELINGS OF A THETA GRAPH 0 (2,b,c) Mujtahid, Zainul Indonesia Theses edge magic labeling, super edge-magic total labeling, theta graph. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/41778 Let ???? be a simple and finite graph with the vertex set ????(????) and the edge set ????(????). An edge magic labeling on ???? is an injective function ???? from ????(????)?????(????) to a subset of integers {1,2,…,|????(????)?????(????)|} with the property that there is a positive integer ???? such as ????(????)+????(????)+????(????????)=???? for each ????????? ????(????). An edge-magic labeling ???? is called super edge-magic labeling if ????(????(????))={1,2,…,|????(????)|}. Let ????,????,???????????? ???? be the positve integers with ??????????????. A theta graph ????(????,????,????) is a graph constructed by embedding the end points of three paths of length consecutive ????,????,???????????? ???? such that there are two vertices of degree three and the other vertices of degree two. In this project we consider super edge-magic total labelings of a theta graph ????(2,????,????). 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 ???? be a simple and finite graph with the vertex set ????(????) and the edge set ????(????). An edge magic labeling on ???? is an injective function ???? from ????(????)?????(????) to a subset of integers {1,2,…,|????(????)?????(????)|} with the property that there is a positive integer ???? such as ????(????)+????(????)+????(????????)=???? for each ????????? ????(????). An edge-magic labeling ???? is called super edge-magic labeling if ????(????(????))={1,2,…,|????(????)|}. Let ????,????,???????????? ???? be the positve integers with ??????????????. A theta graph ????(????,????,????) is a graph constructed by embedding the end points of three paths of length consecutive ????,????,???????????? ???? such that there are two vertices of degree three and the other vertices of degree two. In this project we consider super edge-magic total labelings of a theta graph ????(2,????,????).
format Theses
author Mujtahid, Zainul
spellingShingle Mujtahid, Zainul
SUPER EDGE-MAGIC TOTAL LABELINGS OF A THETA GRAPH 0 (2,b,c)
author_facet Mujtahid, Zainul
author_sort Mujtahid, Zainul
title SUPER EDGE-MAGIC TOTAL LABELINGS OF A THETA GRAPH 0 (2,b,c)
title_short SUPER EDGE-MAGIC TOTAL LABELINGS OF A THETA GRAPH 0 (2,b,c)
title_full SUPER EDGE-MAGIC TOTAL LABELINGS OF A THETA GRAPH 0 (2,b,c)
title_fullStr SUPER EDGE-MAGIC TOTAL LABELINGS OF A THETA GRAPH 0 (2,b,c)
title_full_unstemmed SUPER EDGE-MAGIC TOTAL LABELINGS OF A THETA GRAPH 0 (2,b,c)
title_sort super edge-magic total labelings of a theta graph 0 (2,b,c)
url https://digilib.itb.ac.id/gdl/view/41778
_version_ 1822926080241041408