Browsing MIPA by Author "Baca, M."
Now showing items 1-5 of 5
-
(a,d)-Edge-Antimagic Total Labelings of Caterpillars
Sugeng, K.A.; Miller, M.; Slamin; Baca, M. (Lecture Notes in Computer Science, 2005)For a graph G = (V,E), a bijection g from V(G) ∪ E(G) into { 1,2, ..., ∣ V(G) ∣ + ∣ E(G) ∣ } is called (a,d)-edge-antimagic total labeling of G if the edge-weights w(xy) = g(x) + g(y) + g(xy), xy ∈ E(G), form an arithmetic ... -
Conjectures and open problems on face antimagic evaluations of graphs
Baca, M.; Baskoro, E. T.; Jendrol, S.; Lin, Y.; Miller, M.; Simanjuntak, R.; Slamin; Sugeng, K.A. (Journal of Indonesian Mathematical Society, 2005) -
Edge-magic total labelings of wheels, fans and friendship graphs
Slamin; Baca, M.; Lin, Y.; Miller, M.; Simanjuntak, R. (Bulletins of ICA, 2002)An edge-magic total labeling on a graph with v vertices and e edges will be defined as a one-to-one map taking the vertices and edges onto the integers 1, 2, · · · , v+e with the property that the sum of the label on ... -
On d-antimagic labelings of prisms
Lin, Y.; Slamin; Baca, M.; Miller, M. (Ars Combinatoria, 2004) -
Vertex-antimagic total labelings of graphs
Baca, M.; Bertault, F.; MacDougall, J.A.; Miller, M.; Simanjuntak, R.; Slamin (Discussiones Mathematicae Graph Theory, 2003)In this paper we introduce a new type of graph labeling for a graph G(V;E) called an (a; d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V| + |E| ...