Odd-Graceful Total Colorings for Constructing Graphic Lattice
Keyword(s):
The security of passwords generated by the graphic lattices is based on the difficulty of the graph isomorphism, graceful tree conjecture, and total coloring conjecture. A graphic lattice is generated by a graphic base and graphical operations, where a graphic base is a group of disjointed, connected graphs holding linearly independent properties. We study the existence of graphic bases with odd-graceful total colorings and show graphic lattices by vertex-overlapping and edge-joining operations; we prove that these graphic lattices are closed to the odd-graceful total coloring.
2013 ◽
Vol 30
(2)
◽
pp. 377-388
◽
2013 ◽
Vol 475-476
◽
pp. 379-382
Keyword(s):
Keyword(s):
Keyword(s):
2019 ◽
Vol 11
(01)
◽
pp. 1950014
Keyword(s):
2011 ◽
Vol 474-476
◽
pp. 2341-2345
Keyword(s):
2020 ◽
Vol 12
(03)
◽
pp. 2050032