(H1, H2)-SIM-SUPERMAGIC LABELINGS AND (H1| H2)-SUPERMAGIC LABELINGS OF SOME GRAPHS AND CERTAIN GRAPHS FORMED BY GRAPH OPERATIONS
Let G and H be two simple and finite graphs. A graph G admits an H-covering if each edge of G belongs to a subgraph of G isomorphic to H. Then, a bijection f from the set of vertices union the set of edges V (G) ? E(G) to {1, 2, . . . , |V (G)| + |E(G)|} is called a total labeling of G. Let G be...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertations |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/71798 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |