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...
Saved in:
| Main Author: | |
|---|---|
| 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 |
| Summary: | 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,????,????). |
|---|