16 citations · 34 across the 8 of their papers we have counts for
4 papers · 1 filter
A note on 1-2-3 and 1-2 Conjectures for 3-regular graphs
Jing-zhi Chang, Chao Yang, Zhi-xiang Yin +1
The 1-2-3 Conjecture, posed by Karoński, Łuczak and Thomason, asked whether every connected graph different from can be 3-edge-weighted so that every two adjacent vertice…
Ice-Flower Systems And Star-graphic Lattices
Bing Yao, Hongyu Wang, Xia Liu +4
Lattice theory has been believed to resist classical computers and quantum computers. Since there are connections between traditional lattices and graphic lattices, it is meaningfu…
Graph Homomorphisms Based On Particular Total Colorings of Graphs and Graphic Lattices
Bing Yao, Hongyu Wang
Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorp…
An extremal problem: How small scale-free graph can be
Fei Ma, Ping Wang, Bing Yao
The bloom of complex network study, in particular, with respect to scale-free ones, is considerably triggering the research of scale-free graph itself. Therefore, a great number of…