Anti-magic labeling on a class of sparse graphs
In 1990, Hartsfield and Ringel first introduced the anti-magic labeling and conjectured that every graph other than the complete graph with 2 vertices has an anti-magic labeling. This conjecture has been verified for regular graphs and some classes of trees. In this dissertation we shall prove the a...
| Main Author: | |
|---|---|
| Format: | Final Year Project / Dissertation / Thesis |
| Published: |
2023
|
| Subjects: | |
| Online Access: | http://eprints.utar.edu.my/5408/ http://eprints.utar.edu.my/5408/1/Tai_Yu_Bin.pdf |
| _version_ | 1848886407895973888 |
|---|---|
| author | Tai, Yu Bin |
| author_facet | Tai, Yu Bin |
| author_sort | Tai, Yu Bin |
| building | UTAR Institutional Repository |
| collection | Online Access |
| description | In 1990, Hartsfield and Ringel first introduced the anti-magic labeling and conjectured that every graph other than the complete graph with 2 vertices has an anti-magic labeling. This conjecture has been verified for regular graphs and some classes of trees. In this dissertation we shall prove the anti-magicness of a class of sparse graphs. The thesis begins with a survey on some graph labelings, including antimagic labeling. The thesis continues by introducing graph decompositions and some applications of graph labelings. In the next chapter, we proved that multibridge graphs are anti-magic. The thesis is concluded with a discussion on the anti-magicness of families of sparse graphs obtained by overlapping the multi-bridge graph with itself or with some extended friendship graph. The proof of the anti-magicness of these families of sparse graphs is left as an open problem for future research. |
| first_indexed | 2025-11-15T19:38:01Z |
| format | Final Year Project / Dissertation / Thesis |
| id | utar-5408 |
| institution | Universiti Tunku Abdul Rahman |
| institution_category | Local University |
| last_indexed | 2025-11-15T19:38:01Z |
| publishDate | 2023 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utar-54082023-06-20T14:26:04Z Anti-magic labeling on a class of sparse graphs Tai, Yu Bin QA Mathematics In 1990, Hartsfield and Ringel first introduced the anti-magic labeling and conjectured that every graph other than the complete graph with 2 vertices has an anti-magic labeling. This conjecture has been verified for regular graphs and some classes of trees. In this dissertation we shall prove the anti-magicness of a class of sparse graphs. The thesis begins with a survey on some graph labelings, including antimagic labeling. The thesis continues by introducing graph decompositions and some applications of graph labelings. In the next chapter, we proved that multibridge graphs are anti-magic. The thesis is concluded with a discussion on the anti-magicness of families of sparse graphs obtained by overlapping the multi-bridge graph with itself or with some extended friendship graph. The proof of the anti-magicness of these families of sparse graphs is left as an open problem for future research. 2023 Final Year Project / Dissertation / Thesis NonPeerReviewed application/pdf http://eprints.utar.edu.my/5408/1/Tai_Yu_Bin.pdf Tai, Yu Bin (2023) Anti-magic labeling on a class of sparse graphs. Master dissertation/thesis, UTAR. http://eprints.utar.edu.my/5408/ |
| spellingShingle | QA Mathematics Tai, Yu Bin Anti-magic labeling on a class of sparse graphs |
| title | Anti-magic labeling on a class of sparse graphs |
| title_full | Anti-magic labeling on a class of sparse graphs |
| title_fullStr | Anti-magic labeling on a class of sparse graphs |
| title_full_unstemmed | Anti-magic labeling on a class of sparse graphs |
| title_short | Anti-magic labeling on a class of sparse graphs |
| title_sort | anti-magic labeling on a class of sparse graphs |
| topic | QA Mathematics |
| url | http://eprints.utar.edu.my/5408/ http://eprints.utar.edu.my/5408/1/Tai_Yu_Bin.pdf |