On graphs with α- and b-edge consecutive edge magic labelings
Abstract
Among the most studied graph labelings we have the varieties called alpha and edge-magic. Even when their definitions seem completely different, these labelings are related. A graceful labeling of a bipartite graph is called an α-labeling if the smaller labels are assigned to vertices of the same stable set. An edge-magic labeling of a graph of size n is said to be b-edge consecutive when its edges are labeled with the integers b+1, b+2, ..., b+n, for some 0 ≤ b ≤ n. In this work, we prove the existence of several b edge-magic labelings for any graph of order m and size m-1 that admits an α-labeling. In addition, we determine the exact value of b induced by the α-labeling, as well as for its reverse, complementary, and reverse complementary labelings.
Keywords
Full Text:
PDFDOI: http://dx.doi.org/10.19184/ijc.2022.6.1.4
References
C. Barrientos, Difference Vertex Labelings, Ph.D. Thesis, Universitat Politecnica de Catalunya, Barcelona, 2004.
C. Barrientos and S. Minion, Constructing graceful graphs with caterpillars, J. Algor. Computation, 48 (2016), 117--125.
C. Barrientos and S. Minion, New α-trees and graceful unions of α-graphs and linear forests, J. Combin. Math. Combin. Comput., 108 (2019), 205--220.
C. Barrientos, Alpha graphs with different pendent paths, Elect. J. Graph Th. Appl., 8 (2) (2020), 301--317.
H. Enomoto, A. S. Llado, T. Nakamigawa, and G. Ringel, Super edge-magic graphs, SUT J. Math., 34 (1998) 105--109.
R. Figueroa-Centeno, R. Ichishima, and F. Muntaner-Batle, The place of super edge-magic labelings among other classes of labelings, Discrete Math., 231 (2001) 153--168.
J. A. Gallian, A dynamic survey of graph labeling. Electronic J. Combin., 24 (#DS6.), 2021.
A. Kotzig and A. Rosa, Magic valuations of finite graphs, Canad. Math. Bull., 13 (1970), 451--461.
A. Kotzig, On certain vertex valuations of finite graphs, Util. Math., 4 (1973), 67--73.
A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris (1967) 349--355.
A. Rosa, Labelling snakes, Ars Combin., 3 (1977) 67--74.
K. A. Sugeng and M. Miller, On consecutive edge magic total labelings of graphs, J. Discrete Algorithms, 6 (2008) 59--65.
K. A. Sugeng and D. R. Silaban, On b-edge consecutive edge labeling of some regular trees, Indonesian J. Combin., 4 (1) (2020), 76--81.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.