On consecutive edge magic total labelings of connected bipartite graphs

From MaRDI portal
Publication:512862

DOI10.1007/S10878-015-9928-0zbMATH Open1358.05246arXiv1410.0766OpenAlexW1546309226MaRDI QIDQ512862FDOQ512862

Ji Yeon Park, Suh-Ryung Kim, Bumtle Kang

Publication date: 3 March 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Abstract: Since Sedl'{a}ek introduced the notion of magic labeling of a graph in 1963, a variety of magic labelings of a graph have been defined and studied. In this paper, we study consecutive edge magic labelings of a connected bipartite graph. We make a very useful observation that there are only four possible values of b for which a connected bipartite graph has a b-edge consecutive magic labeling. On the basis of this fundamental result, we deduce various interesting results on consecutive edge magic labelings of bipartite graphs, especially caterpillars and lobsters, which extends the results given by Sugeng and Miller.


Full work available at URL: https://arxiv.org/abs/1410.0766




Recommendations




Cites Work


Cited In (3)





This page was built for publication: On consecutive edge magic total labelings of connected bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512862)