Mohaimen-Bin-Noor
ABSTRACT
Graph labelling is a very popular and high caliber research topic in graph theory. There are numerous variant of graph labelling. Some are categorized as edge labelling and some are categorized as vertex labelling. Our paper focuses to proof 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.
- Michael D Barrus. 2010. Antimagic labeling and canonical decomposition of graphs. Inform. Process. Lett. 110, 7 (2010), 261--263.Google Scholar
Digital Library
- Tero Harju. 2001. Lecture Notes on GRAPH THEORY.Google Scholar
- Md. Rafiqul Islam and M.A. Mottalib. 2011. Data Structures Fundamentals. Research, Extension, Advisory Services and Publication, Gazipur, Bangladesh. 94--98 pages.Google Scholar
- Michael Jackanich. 2011. Antimagic labeling of graphs. Ph.D. Dissertation. San Francisco State University.Google Scholar
- J Jayapriya and K Thirusangu. 2013. MAX-MIN EDGE MAGIC AND ANTIMAGIC LABELING. European Scientific Journal 9, 21 (2013).Google Scholar
- Auparajita Krishnaa. 2004. A study of the major graph labelings of trees. Informatica 15, 4 (2004), 515--524.Google ScholarDigital Library
- T Nicholas. 2001. Some labeling problems in graph theory (A, D) antimagic sum integral sum and prime labelings.Google Scholar
- Edward A Scheinerman. 2012. Mathematics: a discrete introduction. Nelson Education, Canada.Google Scholar
- Xingbo Wang and Zhen Shen. 2018. Analytic Formulas to Calculate Symmetric Brothers of a Node in a Perfect Binary Tree. Journal of Mathematics Research 10, 5 (2018), 45--48.Google ScholarCross Ref
- Douglas Brent West et al. 1996. Introduction to graph theory. Vol. 2. Prentice Hall, Upper Saddle River, NJ, USA.Google Scholar
- Robin J Wilson. 1979. Introduction to graph theory. Pearson Education India, Delhi, India.Google Scholar
Index Terms
- Antimagic Labelling of any Perfect Binary Tree
Recommendations
Antimagic labelling of vertex weighted graphs
Suppose G is a graph, k is a non-negative integer. We say G is k-antimagic if there is an injection f: E→{1, 2, …, |E| + k} such that for any two distinct vertices u and v, . We say G is weighted-k-antimagic if for any vertex weight function w: V→ℕ, ...
A Generalized Version of a Local Antimagic Labelling Conjecture
An antimagic labelling of a graph G with m edges is a bijection $$f: E(G) \rightarrow \{1,\ldots ,m\}$$f:E(G)ý{1,ý,m} such that for any two distinct vertices u, v we have $$\sum _{e \in E(v)}f(e) \ne \sum _{e \in E(u)}f(e)$$ýeýE(v)f(e)ýýeýE(u)f(e), ...
Regular bipartite graphs are antimagic
A labeling of a graph G is a bijection from E(G) to the set {1, 2,… |E(G)|}. A labeling is antimagic if for any distinct vertices u and v, the sum of the labels on edges incident to u is different from the sum of the labels on edges incident to v. We say a ...
Comments