On consecutive edge magic total labelings of connected bipartite graphs
From MaRDI portal
(Redirected from Publication:512862)
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 for which a connected bipartite graph has a -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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1269934 (Why is no real title available?)
- scientific article; zbMATH DE number 951849 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Magic Graphs
- Magic Valuations of Finite Graphs
- On consecutive edge magic total labeling of graphs
- On super edge-magic graphs.
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)