SOME SUPER EDGE-MAGIC TOTAL LABELINGS OF THE TREE GRAPH T A,C,D
Let G = (V (G), E (G) ) be a simple and finite graph with the vertex-set V (G) and the edge-set E (G). An edge-magic total labeling of a graph G is an injective function f from V (G) U E (G) ke {1,2,3, … , |V (G) | + |E (G) |} such that there exists a positive integer...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/10711 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:10711 |
|---|---|
| spelling |
id-itb.:107112017-09-27T14:41:45ZSOME SUPER EDGE-MAGIC TOTAL LABELINGS OF THE TREE GRAPH T A,C,D SURYADI, IYAN Indonesia Theses INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/10711 Let G = (V (G), E (G) ) be a simple and finite graph with the vertex-set V (G) and the edge-set E (G). An edge-magic total labeling of a graph G is an injective function f from V (G) U E (G) ke {1,2,3, … , |V (G) | + |E (G) |} such that there exists a positive integer k satisfying f (u) + f (uv) + f (v) = k for each uv E E(G). A graph having an edge-magic total labeling is called a total edge-magic graph. In this case, if f (V(G)) = {1,2,3, … , |V (G)|}, then f is called a super edge-magic total labeling of G and G is called a super edgemagic total graph. <br /> 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 (G), E (G) ) be a simple and finite graph with the vertex-set V (G) and the edge-set E (G). An edge-magic total labeling of a graph G is an injective function f from V (G) U E (G) ke {1,2,3, … , |V (G) | + |E (G) |} such that there exists a positive integer k satisfying f (u) + f (uv) + f (v) = k for each uv E E(G). A graph having an edge-magic total labeling is called a total edge-magic graph. In this case, if f (V(G)) = {1,2,3, … , |V (G)|}, then f is called a super edge-magic total labeling of G and G is called a super edgemagic total graph. <br />
|
| format |
Theses |
| author |
SURYADI, IYAN |
| spellingShingle |
SURYADI, IYAN SOME SUPER EDGE-MAGIC TOTAL LABELINGS OF THE TREE GRAPH T A,C,D |
| author_facet |
SURYADI, IYAN |
| author_sort |
SURYADI, IYAN |
| title |
SOME SUPER EDGE-MAGIC TOTAL LABELINGS OF THE TREE GRAPH T A,C,D |
| title_short |
SOME SUPER EDGE-MAGIC TOTAL LABELINGS OF THE TREE GRAPH T A,C,D |
| title_full |
SOME SUPER EDGE-MAGIC TOTAL LABELINGS OF THE TREE GRAPH T A,C,D |
| title_fullStr |
SOME SUPER EDGE-MAGIC TOTAL LABELINGS OF THE TREE GRAPH T A,C,D |
| title_full_unstemmed |
SOME SUPER EDGE-MAGIC TOTAL LABELINGS OF THE TREE GRAPH T A,C,D |
| title_sort |
some super edge-magic total labelings of the tree graph t a,c,d |
| url |
https://digilib.itb.ac.id/gdl/view/10711 |
| _version_ |
1820665939330334720 |