Number-Based Strings/Passwords From Imaginary Graphs Of Topological Coding For Encryption

For letting graphic lattices approaching lattices, we define imaginary graphs and the leaf-splitting operation and the leaf-coinciding operation, and show an equivalent property: The leaf-splitting connectivity of a connected im-graph is equivalent to its edge connectivity. Using im-graphs produce complex degree-sequence lattices, graphic lattices, im-graphs in the integer decomposition problem, topological IoT-networks and data-functional IoT-networks. Each integer m with |m| ≥ 2 corresponds at least a graph or an im-graph. We try to build some connections between popular lattices and our lattices, and moreover propose some problems on Hanzi-writings lattices constructed by Chinese character coding.