Regular Bipartite Graphs of Odd Degree are Antimagic
| dc.contributor.advisor | Belaineh, Zelealem (PhD) | |
| dc.contributor.author | Tolcha, Solomon | |
| dc.date.accessioned | 2018-07-18T07:08:10Z | |
| dc.date.accessioned | 2023-11-04T12:30:35Z | |
| dc.date.available | 2018-07-18T07:08:10Z | |
| dc.date.available | 2023-11-04T12:30:35Z | |
| dc.date.issued | 2013-06 | |
| dc.description.abstract | A labeling of a graph G is an assignment of integers to the edges,vertices or both edges and vertices of a graph subject to certain conditions. A vertex-sum for a labeling is the sum of the labels on edges incident to a vertex v. In this work we focus on edge labeling. A labeling is antimagic if there is a bijection from the edges of G to f1; 2; jEjg such that the sum of the labels incident to each vertex is distinct. We say a graph is antimagic if it has an antimagic labeling The aim of this work is to construct an antimagic labeling for regular bipartite graph of odd degree. Our proof technique relies mostly on the Marriage Theorem | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/9141 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Regular Bipartite Graphs of Odd Degree | en_US |
| dc.title | Regular Bipartite Graphs of Odd Degree are Antimagic | en_US |
| dc.type | Thesis | en_US |