Your selections:

Format Type

Magic and antimagic labeling of graphs

**Authors:**Sugeng, Kiki Ariyanti**Date:**2005**Type:**Text , Thesis , PhD**Full Text:****Description:**"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."**Description:**Doctor of Philosophy

**Authors:**Sugeng, Kiki Ariyanti**Date:**2005**Type:**Text , Thesis , PhD**Full Text:****Description:**"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."**Description:**Doctor of Philosophy

On consecutive edge magic total labeling of graphs

- Sugeng, Kiki Ariyanti, Miller, Mirka

**Authors:**Sugeng, Kiki Ariyanti , Miller, Mirka**Date:**2008**Type:**Text , Journal article**Relation:**Journal of Discrete Algorithms Vol. 6, no. 1 (2008), p. 59-65**Full Text:**false**Reviewed:****Description:**Let G = (V, E) be a finite (non-empty) graph, where V and E are the sets of vertices and edges of G. An edge magic total labeling is a bijection**Description:**C1

- «
- ‹
- 1
- ›
- »

Are you sure you would like to clear your session, including search history and login status?