Face Bimagic Labeling On Some Graphs
2021 ◽
Vol 12
(6)
◽
pp. 101-107
Keyword(s):
The existence of face bimagic labeling of types (1,0,1), (1,1,0) and (0,1,1) for double duplication of all vertices by edges of a ladder graph is proved. Also if G is (1, 0, 1) face bimagic, except for three sided faces then double duplication of all vertices by edges of G is face bimagic.
2021 ◽
Vol 1836
(1)
◽
pp. 012026
Keyword(s):
1974 ◽
Vol 2
(1)
◽
pp. 105-105
Keyword(s):
2020 ◽
Vol 17
(3)
◽
pp. 810-819