Odd-Graceful Total Colorings for Constructing Graphic Lattice

Jing Su, Hui Sun and Bing Yao
Additional contact information
Jing Su: School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China
Hui Sun: School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China
Bing Yao: College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China

Mathematics, 2021, vol. 10, issue 1, 1-11

Abstract: 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.

Keywords: lattice-based cryptology; graphic lattice; total coloring; graph labeling; topological authentication (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/1/109/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/1/109/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2021:i:1:p:109-:d:714599

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().