#TITLE_ALTERNATIVE#
Abstract: <br /> <br /> <br /> <br /> <br /> Supermagic labelling is a variation of total labelling in a graph. A graph G =(V(G), E(G)) of order n is said to be supermagic if there exists a bijection <br /> <br /> <br /> <br /> <br /...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/6191 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Abstract: <br />
<br />
<br />
<br />
<br />
Supermagic labelling is a variation of total labelling in a graph. A graph G =(V(G), E(G)) of order n is said to be supermagic if there exists a bijection <br />
<br />
<br />
<br />
<br />
In this book we discuss the result that every tree of order n is contained in supermagic tree and we create an algorithm for searching supertree which is supermagic from a tree. <br />
|
|---|