Antimagic Labelling of any Perfect Binary Tree

Mohaimen-Bin-Noor, Md. Manzurul Hasan

Please use this identifier to cite or link to this item: http://dspace.aiub.edu:8080/jspui/handle/123456789/2904

Full metadata record

DC Field	Value	Language
dc.contributor.author	Mohaimen-Bin-Noor, Md. Manzurul Hasan	-
dc.date.accessioned	2025-10-14T09:37:50Z	-
dc.date.available	2025-10-14T09:37:50Z	-
dc.date.issued	2020-01-10	-
dc.identifier.uri	https://dl.acm.org/doi/abs/10.1145/3377049.3377109	-
dc.identifier.uri	http://dspace.aiub.edu:8080/jspui/handle/123456789/2904	-
dc.description	An enhanced approach of edge labeling of graph which is named as the Antimagic labeling for a perfect binary tree. It is proved in the article that it is possible to label all the edges of a perfect tree by the mentioned approach in it.	en_US
dc.description.abstract	Graph labelling is a very popular and high caliber research topic in graph theory. There are numerous variants of graph labelling. Some are categorized as edge labelling, and some are categorized as vertex labelling. Our paper focuses on proof of one kind of edge labelling known as antimagic labelling of any perfect binary tree. First, we have shown that antimagic labelling is possible by sequential labelling of the edges of any perfect binary trees except for some particular ones. Later we proved that antimagic labelling is also possible for those particular perfect binary trees by swapping the labels of only two egdes.	en_US
dc.description.sponsorship	self and supervisor	en_US
dc.language.iso	en_US	en_US
dc.publisher	ACM	en_US
dc.subject	vertex labelling, antimagic labelling , swapping	en_US
dc.title	Antimagic Labelling of any Perfect Binary Tree	en_US
dc.type	Article	en_US
Appears in Collections:	Publications: Conference

Files in This Item:

File	Description	Size	Format
Antimagic Labelling of any Perfect Binary Tree.docx		4.66 MB	Microsoft Word XML	View/Open

Show simple item record

AIUB DSpace

Welcome to the Institutional Repository of American International University-Bangladesh. We preserve and enable easy and open access to all types of digital content including text, images, moving images, mpegs and data sets.