IMPLEMENTATION INTEGER LINEAR PROGRAMMING FOR VERTEX MAGIC TOTAL LABELLING
..... One of the problems in graph labelling is to determine whether a graph can be labelled or not. There are several approach to label graph, one of them is computational method. In this thesis is we use integer linear programming with zero one programming to find vertex magic total labellin...
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Subjects: | |
Online Access: | https://digilib.itb.ac.id/gdl/view/33371 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |