MULTIPLE DIAMOND GRAPH LABELINGS
Let G = (V (G),E(G)) be afinite,undirected,andsimplegraph.Thisstudyuses diamond graphs.Foranaturalnumber n with n ? 2, adiamondgraphthathas 2n vertices and 5n ? 5 edgesisdenotedby Brn. Observedseverallabelsonadia- mond graph,suchasanedge-magicvertex-labeling,avertex (a, d)-edgeantimagic labeling...
Saved in:
Main Author: | Arif Susilo, Alfiatri |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/71878 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
On labelling harmonious graphs
by: Fabros, Roland R., et al.
Published: (1998) -
VERTEX TOTAL LABELING OF COMPLETE GRAPHS AND GRAPH
by: AW WEI LING CHERYL ANDREA
Published: (2021) -
DISTANCE ANTIMAGIC LABELING OF GRAPHS
by: Tegar Tritama, Aholiab -
The complexity of the evolution of GRAPH LABELINGS
by: Geir Agnarsson, et al.
Published: (2018) -
Graph relabeling with stacked labels
by: Pochara Patthamalai, et al.
Published: (2018)