41 citations · 116 across the 15 of their papers we have counts for
15 papers
Pure Core Sets of Matrices over Finite Fields
Hongyu Wang, Yizhi Zhang
This paper studies the structure of core sets under different similarity classes. We investigate the influence of factors of the minimal polynomial with different degrees on the st…
Parameterized Colorings And Labellings Of Graphs In Topological Coding
Bing Yao, Xiaohui Zhang, Hui Sun +3
The coming quantum computation is forcing us to reexamine the cryptosystems people use. We are applying graph colorings of topological coding to modern information security and fut…
Topological Authentication Technique In Topologically Asymmetric Cryptosystem
Bing Yao, Jing Su, Fei Ma +2
Making topological authentication from theory to practical application is an important and challenging task. More and more researchers pay attention on coming quantum computation,…
Recent Colorings And Labelings In Topological Coding
Bing Yao, Hongyu Wang
Topological Coding consists of two different kinds of mathematics: topological structure and mathematical relation. The colorings and labelings of graph theory are main techniques…
AEGCN: An Autoencoder-Constrained Graph Convolutional Network
Mingyuan Ma, Sen Na, Hongyu Wang
We propose a novel neural network architecture, called autoencoder-constrained graph convolutional network, to solve node classification task on graph domains. As suggested by its…
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…
Topological Coding and Topological Matrices Toward Network Overall Security
Bing Yao, Meimei Zhao, Xiaohui Zhang +9
A mathematical topology with matrix is a natural representation of a coding relational structure that is found in many fields of the world. Matrices are very important in computati…
Using Chinese Characters To Generate Text-Based Passwords For Information Security
Bing Yao, Yarong Mu, Yirong Sun +12
Graphical passwords (GPWs) are in many areas of the current world. Topological graphic passwords (Topsnut-gpws) are a new type of cryptography, and they differ from the existing GP…
The Graph-Based Behavior-Aware Recommendation for Interactive News
Mingyuan Ma, Sen Na, Hongyu Wang +2
Interactive news recommendation has been launched and attracted much attention recently. In this scenario, user's behavior evolves from single click behavior to multiple behaviors…
Text-based Passwords Generated From Topological Graphic Passwords
Bing Yao, Xiaohui Zhang, Hui Sun +9
Topological graphic passwords (Topsnut-gpws) are one of graph-type passwords, but differ from the existing graphical passwords, since Topsnut-gpws are saved in computer by algebrai…
Topological Graphic Passwords And Their Matchings Towards Cryptography
Bing Yao, Hui Sun, Xiaohui Zhang +7
Graphical passwords (GPWs) are convenient for mobile equipments with touch screen. Topological graphic passwords (Topsnut-gpws) can be saved in computer by classical matrices and r…
Graph Theory Towards New Graphical Passwords In Information Networks
Bing Yao, Hui Sun, Hongyu Wang +2
Graphical passwords (GPWs) have been studied over 20 years. We are motivated from QR codes that can be considered GPWs, are successfully applied in today's world. However, one need…
Improper Graceful and Odd-graceful Labellings of Graph Theory
Hongyu Wang, Jin Xu, Bing Yao
In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can ind…
The groupies of random multipartite graphs
Marius Portmann, Hongyun Wang
If a vertex in a graph has degree larger than the average of the degrees of its neighbors, we call it a groupie in . In the current work, we study the behavior of groupi…