"A bijection mapping that assigns natural numbers to vertices and/or edges of a graph is called a labeling. In this thesis, we consider graph labelings that have weights associated with each edge and/or vertex. If all the vertex weights (respectively, edge weights) have the same value then the labeling is called magic. If the weight is different for every vertex (respectively, every edge) then we called the labeling antimagic. In this thesis we introduce some variations of magic and antimagic labelings and discuss their properties and provide corresponding labeling schemes. There are two main parts in this thesis. One main part is on vertex labeling and the other main part is on edge labeling." / Doctor of Philosophy
| Identifer | oai:union.ndltd.org:ADTP/266058 |
| Date | January 2005 |
| Creators | Sugeng, Kiki Ariyanti |
| Publisher | University of Ballarat |
| Source Sets | Australiasian Digital Theses Program |
| Detected Language | English |
| Rights | Copyright Kiki Ariyanti |
Page generated in 0.0016 seconds